A Completeness Result for SLDNF-Resolution
- 1 April 1993
- journal article
- Published by Elsevier in The Journal of Logic Programming
- Vol. 15 (4) , 337-355
- https://doi.org/10.1016/s0743-1066(14)80003-4
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Acyclic logic programs and the completeness of SLDNF-resolutionTheoretical Computer Science, 1991
- A completeness theorem for SLDNF resolutionThe Journal of Logic Programming, 1989
- Signed data dependencies in logic programsThe Journal of Logic Programming, 1989
- A basis for deductive database systems IIThe Journal of Logic Programming, 1986
- Orderings for term-rewriting systemsTheoretical Computer Science, 1982