Acyclic logic programs and the completeness of SLDNF-resolution
- 19 August 1991
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 86 (1) , 81-92
- https://doi.org/10.1016/0304-3975(91)90005-m
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Completed logic programs and their consistencyThe Journal of Logic Programming, 1990
- A completeness theorem for SLDNF resolutionThe Journal of Logic Programming, 1989
- Signed data dependencies in logic programsThe Journal of Logic Programming, 1989
- On the declarative and procedural semantics of logic programsJournal of Automated Reasoning, 1989
- Nonmonotonic logic and temporal projectionArtificial Intelligence, 1987
- A basis for deductive database systems IIThe Journal of Logic Programming, 1986
- Negation as failure: a comparison of Clark's completed data base and Reiter's closed world assumptionThe Journal of Logic Programming, 1984