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

Venue: | Theoretical Computer Science |

Citations: | 99 - 22 self |

### BibTeX

@ARTICLE{Eiter93propositionalcircumscription,

author = {Thomas Eiter and Georg Gottlob},

title = {Propositional Circumscription and Extended Closed World Reasoning are $\Pi^P_2$-complete},

journal = {Theoretical Computer Science},

year = {1993},

volume = {114},

pages = {231--245}

}

### Years of Citing Articles

### OpenURL

### 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.