Propositional Circumscription and Extended Closed World Reasoning are $\Pi^P_2$-complete

Propositional Circumscription and Extended Closed World Reasoning are $\Pi^P_2$-complete (1993)

by Thomas Eiter , Georg Gottlob

Venue:	Theoretical Computer Science
Citations:	94 - 21 self

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Propositional Circumscription and Extended Closed World Reasoning are $\Pi^P_2$-complete	user correction - Legacy Corrections
AUTHOR NAME	Thomas Eiter	SVM HeaderParse 0.1
AUTHOR AFFIL	Christian Doppler Labor fur Expertensysteme; Institut fur Informationssysteme	SVM HeaderParse 0.2
AUTHOR ADDR	Technische Universitat Wien, Austria	SVM HeaderParse 0.1
AUTHOR NAME	Georg Gottlob	SVM HeaderParse 0.1
AUTHOR AFFIL	Christian Doppler Labor fur Expertensysteme; Institut fur Informationssysteme	SVM HeaderParse 0.2
AUTHOR ADDR	Technische Universitat Wien, Austria	SVM HeaderParse 0.1
ABSTRACT	Circumscription and the closed world assumption with its variants are well-known nonmonotonic techniques for reasoning with incomplete knowledge. Their complexity in the propositional case has been studied in detail for fragments of propositional logic. One open problem is whether the deduction problem for arbitrary propositional theories under the extended closed world assumption or under circumscription is $\Pi^P_2$-complete, i.e., complete for a class of the second level of the polynomial hierarchy. We answer this question by proving these problems $\Pi^P_2$-complete, and we show how this result applies to other variants of closed world reasoning.	user correction - Legacy Corrections
YEAR	1993	INFERENCE
VENUE	Theoretical Computer Science	INFERENCE
VENUE TYPE	JOURNAL	INFERENCE
PAGES	231--245	INFERENCE
VOLUME	114	INFERENCE
CITATIONS	37 found	ParsCit 1.0