Acyclic logic programs and the completeness of SLDNF-resolution

DOI10.1016/0304-3975(91)90005-MzbMath0738.68015OpenAlexW2015695472MaRDI QIDQ1177925

Lawrence Cavedon

Publication date: 26 June 1992

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(91)90005-m

zbMATH Keywords

completenessSLDNF-resolutionacyclic programs

Mathematics Subject Classification ID

Logic programming (68N17)

Related Items

Logic programs and connectionist networks, Logic programs, iterated function systems, and recurrent radial basis function networks, Negation as failure for disjunctive logic programming, Generalized metrics and uniquely determined logic programs., A class of programs for which \(SLDNF\) resolution and \(NAF\) rule are complete

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Nonmonotonic logic and temporal projection
• On the declarative and procedural semantics of logic programs
• A completeness theorem for SLDNF resolution
• Completed logic programs and their consistency
• Negation as failure: a comparison of Clark's completed data base and Reiter's closed world assumption
• A basis for deductive database systems II
• Correct answers to allowed programs and queries are ground