The complexity of propositional closed world reasoning and circumscription
- 1 April 1994
- journal article
- review article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 48 (2) , 255-310
- https://doi.org/10.1016/s0022-0000(05)80004-2
Abstract
No abstract availableKeywords
This publication has 24 references indexed in Scilit:
- A survey of complexity results for non-monotonic logicsThe Journal of Logic Programming, 1993
- Propositional circumscription and extended closed-world reasoning are ΠP2-completeTheoretical Computer Science, 1993
- The complexity of model checking for circumscriptive formulaeInformation Processing Letters, 1992
- An efficient method for eliminating varying predicates from a circumscriptionArtificial Intelligence, 1992
- The computational complexity of abductionArtificial Intelligence, 1991
- Eliminating the fixed predicates from a circumscriptionArtificial Intelligence, 1989
- On the relationship between circumscription and negation as failureArtificial Intelligence, 1989
- Negation as failure: Careful closure procedureArtificial Intelligence, 1986
- Linear-time algorithms for testing the satisfiability of propositional horn formulaeThe Journal of Logic Programming, 1984
- On the Complexity of Timetable and Multicommodity Flow ProblemsSIAM Journal on Computing, 1976