Depth-bounded bottom-up evaluation of logic programs
- 31 October 1995
- journal article
- Published by Elsevier BV in The Journal of Logic Programming
- Vol. 25 (1), 1-31
- https://doi.org/10.1016/0743-1066(94)00030-a
Abstract
We present here a depth-bounded bottom-up evaluation algorithm for logic programs. We show that it is sound, complete, and terminating for finite-answer queries if the programs are syntactically restricted to DatalognS, a class of logic programs with limited function symbols. DatalognS is an extension of Datalog capable of representing infinite phenomena. Predicates in DatalognS can have arbitrary unary and limited n-ary function symbols in one distinguished argument. We precisely characterize the computational complexity of depth-bounded evaluation for DatalognS and compare depth-bounded evaluation with other evaluation methods, top-down and Magic Sets among others. We also show that universal safety (finiteness of query answers for any database) is decidable for DatalognS.Keywords
This publication has 17 references indexed in Scilit:
- Finite representation of infinite query answersACM Transactions on Database Systems, 1993
- Resolution Methods for the Decision ProblemLecture Notes in Computer Science, 1993
- Magic templates: a spellbinding approach to logic programsThe Journal of Logic Programming, 1991
- Temporal logic programmingJournal of Symbolic Computation, 1989
- SYGRAF: implementing logic programs in a database styleIEEE Transactions on Software Engineering, 1988
- Enumeration of success patterns in logic programsTheoretical Computer Science, 1984
- Complete problems in the first-order predicate calculusJournal of Computer and System Sciences, 1984
- Structure and complexity of relational queriesJournal of Computer and System Sciences, 1982
- Complexity results for classes of quantificational formulasJournal of Computer and System Sciences, 1980
- Resolution Strategies as Decision ProceduresJournal of the ACM, 1976