Generalizing allowedness while retaining completeness of SLDNF-resolution
- 1 January 1990
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 21 references indexed in Scilit:
- 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 programmingThe Journal of Logic Programming, 1987
- Foundations of Logic ProgrammingPublished by Springer Nature ,1987
- A basis for deductive database systems IIThe Journal of Logic Programming, 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
- Making prolog more expressiveThe Journal of Logic Programming, 1984
- Negation as FailurePublished by Springer Nature ,1978