Backchain iteration: Towards a practical inference method that is simple enough to be proved terminating, sound, and complete
Author:
- 1 January 1993
- journal article
- Published by Springer Nature in Journal of Automated Reasoning
- Vol. 11 (1) , 1-22
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Modular stratification and magic sets for DATALOG programs with negation1990
- Recursive query processing: the power of logicTheoretical Computer Science, 1989
- Translation of logic programs into functional fixpoint equationsTheoretical Computer Science, 1989
- Performance Evaluation of Data Intensive Logic Programs1988
- Towards a Theory of Declarative Knowledge1988
- Magic sets and other strange ways to implement logic programs (extended abstract)1985
- Parsing as deduction1983
- Contributions to the Theory of Logic ProgrammingJournal of the ACM, 1982
- The Semantics of Predicate Logic as a Programming LanguageJournal of the ACM, 1976
- A Proof Procedure Using Connection GraphsJournal of the ACM, 1975