Strict completion of Logic Programs
- 1 April 1991
- journal article
- Published by Springer Nature in New Generation Computing
- Vol. 9 (1) , 69-79
- https://doi.org/10.1007/bf03037151
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- RECOGNIZING NON-FLOUNDERING LOGIC PROGRAMS AND GOALSInternational Journal of Foundations of Computer Science, 1990
- A completeness theorem for SLDNF resolutionThe Journal of Logic Programming, 1989
- Signed data dependencies in logic programsThe Journal of Logic Programming, 1989
- Towards a Theory of Declarative KnowledgePublished by Elsevier ,1988
- Negation in Logic ProgrammingPublished by Elsevier ,1988
- Negation in logic programmingThe Journal of Logic Programming, 1987
- Negation as Failure. Completeness of the Query Evaluation Process for horn clause programs with recursive definitionsJournal of Automated Reasoning, 1986
- Completeness of the SLDNF-resolution for a class of logic programsPublished by Springer Nature ,1986
- A kripke-kleene semantics for logic programs*The Journal of Logic Programming, 1985
- Negation as FailurePublished by Springer Nature ,1978