Pages that link to "Item:Q910251"

The following pages link to Generalized closed world assumption is \(\Pi ^ 0_ 2\)-complete (Q910251):

Displayed 4 items.

• Computing minimal models by partial instantiation (Q672131) ‎ (← links)
• Expressive power and complexity of partial models for disjunctive deductive databases (Q1274974) ‎ (← links)
• On the computational cost of disjunctive logic programming: Propositional case (Q1924780) ‎ (← links)
• Propositional circumscription and extended closed-world reasoning are \(\Pi_ 2^ P\)-complete (Q2367539) ‎ (← links)