Negation by default and unstratifiable logic programs
- 21 January 1991
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 78 (1), 85-112
- https://doi.org/10.1016/0304-3975(51)90004-7
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- Minimalism, justification and non-monotonicity in deductive databasesJournal of Computer and System Sciences, 1989
- Complete logic programs with domain-closure axiomThe Journal of Logic Programming, 1988
- On the relation between default and autoepistemic logicArtificial Intelligence, 1988
- Negation as failure. IIThe Journal of Logic Programming, 1985
- Horn clause queries and generalizationsThe Journal of Logic Programming, 1985
- Saturation, nonmonotonic reasoning and the closed-world assumptionArtificial Intelligence, 1985
- Semantical considerations on nonmonotonic logicArtificial Intelligence, 1985
- Linear-time algorithms for testing the satisfiability of propositional horn formulaeThe Journal of Logic Programming, 1984
- Contributions to the Theory of Logic ProgrammingJournal of the ACM, 1982
- A Computing Procedure for Quantification TheoryJournal of the ACM, 1960