Propositional circumscription and extended closed-world reasoning are ΠP2-complete
- 21 June 1993
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 114 (2) , 231-245
- https://doi.org/10.1016/0304-3975(93)90073-3
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- Generalized Closed World Assumption is II02-CompleteInformation Processing Letters, 1990
- Some computational aspects of circumscriptionJournal of the ACM, 1990
- PNP[(log )] and sparse turing-complete sets for NPJournal of Computer and System Sciences, 1989
- On the relationship between circumscription and negation as failureArtificial Intelligence, 1989
- The Polynomial Time Hierarchy Collapses If the Boolean Hierarchy CollapsesSIAM Journal on Computing, 1988
- The complexity of optimization problemsJournal of Computer and System Sciences, 1988
- Polynomial terse setsInformation and Computation, 1988
- Negation as failure: Careful closure procedureArtificial Intelligence, 1986
- The NP-completeness column: An ongoing guideJournal of Algorithms, 1985
- On the unique satisfiability problemInformation and Control, 1982