A survey of complexity results for non-monotonic logics
- 1 November 1993
- journal article
- Published by Elsevier in The Journal of Logic Programming
- Vol. 17 (2-4), 127-160
- https://doi.org/10.1016/0743-1066(93)90029-g
Abstract
No abstract availableThis publication has 92 references indexed in Scilit:
- The Complexity of Nested Counterfactuals and Iterated Knowledge Base RevisionsJournal of Computer and System Sciences, 1996
- Why not negation by fixpoint?Journal of Computer and System Sciences, 1991
- Negation by default and unstratifiable logic programsTheoretical Computer Science, 1991
- Negation in rule-based database languages: a surveyTheoretical Computer Science, 1991
- Generalized Closed World Assumption is II02-CompleteInformation Processing Letters, 1990
- Minimalism, justification and non-monotonicity in deductive databasesJournal of Computer and System Sciences, 1989
- On the computability of circumscriptionInformation Processing Letters, 1988
- Decidability and definability with circumscriptionAnnals of Pure and Applied Logic, 1987
- Querying logical databasesJournal of Computer and System Sciences, 1986
- Linear-time algorithms for testing the satisfiability of propositional horn formulaeThe Journal of Logic Programming, 1984