Backchain iteration: Towards a practical inference method that is simple enough to be proved terminating, sound, and complete

DOI10.1007/BF00881898zbMath0784.68025OpenAlexW1989282019MaRDI QIDQ1311394

Adrian Walker

Publication date: 13 January 1994

Published in: Journal of Automated Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00881898

zbMATH Keywords

efficiencycompletenessterminationdeductive databasesoundnessdatabase applicationBackchain iterationexecutable specificationmeta-interpreterre-use of methodsstratified datalog programs with negation

Mathematics Subject Classification ID

Logic programming (68N17)

Related Items (1)

Backchain iteration: Towards a practical inference method that is simple enough to be proved terminating, sound, and complete

Cites Work

• Unnamed Item
• Recursive query processing: The power of logic
• Backchain iteration: Towards a practical inference method that is simple enough to be proved terminating, sound, and complete
• Translation of logic programs into functional fixpoint equations
• Contributions to the Theory of Logic Programming
• The Semantics of Predicate Logic as a Programming Language
• A Proof Procedure Using Connection Graphs

This page was built for publication: Backchain iteration: Towards a practical inference method that is simple enough to be proved terminating, sound, and complete