Depth-bounded bottom-up evaluation of logic programs
- 31 October 1995
- journal article
- Published by Elsevier in The Journal of Logic Programming
- Vol. 25 (1) , 1-31
- https://doi.org/10.1016/0743-1066(94)00030-a
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Finite representation of infinite query answersACM Transactions on Database Systems, 1993
- Resolution Methods for the Decision ProblemPublished by Springer Nature ,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