Generalized closed world assumption is ^ 0_ 2-complete
From MaRDI portal
Publication:910251
DOI10.1016/0020-0190(90)90012-MzbMATH Open0695.68064MaRDI QIDQ910251FDOQ910251
Authors: Jan Chomicki, V. S. Subrahmanian 
Publication date: 1990
Published in: Information Processing Letters (Search for Journal in Brave)
Recommendations
Artificial intelligence (68T99) Hierarchies of computability and definability (03D55) Undecidability and degrees of sets of sentences (03D35)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the relationship between circumscription and negation as failure
- Deduction in non-Horn databases
- Title not available (Why is that?)
- Title not available (Why is that?)
- Decidability and definability with circumscription
- Inferring negative information from disjunctive databases
- Weak generalized closed world assumption
- Title not available (Why is that?)
Cited In (7)
- Expressive power and complexity of partial models for disjunctive deductive databases
- Propositional circumscription and extended closed-world reasoning are \(\Pi_ 2^ P\)-complete
- On the computational cost of disjunctive logic programming: Propositional case
- Title not available (Why is that?)
- Generalized well-founded semantics for logic programs
- Annotations on the consistency of the closed world assumption
- Computing minimal models by partial instantiation
This page was built for publication: Generalized closed world assumption is \(\Pi ^ 0_ 2\)-complete
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q910251)
