A transformational approach to negation in logic programming
- 31 May 1990
- journal article
- research article
- Published by Elsevier in The Journal of Logic Programming
- Vol. 8 (3) , 201-228
- https://doi.org/10.1016/0743-1066(90)90023-x
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Complete logic programs with domain-closure axiomThe Journal of Logic Programming, 1988
- Explicit representation of terms defined by counter examplesJournal of Automated Reasoning, 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
- Negation as failure. IIThe Journal of Logic Programming, 1985
- A basis for deductive database systemsThe Journal of Logic Programming, 1985
- A theory of complete logic programs with equalityThe Journal of Logic Programming, 1984
- Negation as failure: a comparison of Clark's completed data base and Reiter's closed world assumptionThe Journal of Logic Programming, 1984
- Closures and fairness in the semantics of programming logicTheoretical Computer Science, 1984
- Contributions to the Theory of Logic ProgrammingJournal of the ACM, 1982