Pages that link to "Item:Q2367539"

The following pages link to Propositional circumscription and extended closed-world reasoning are \(\Pi_ 2^ P\)-complete (Q2367539):

Displayed 24 items.

• Reasoning under minimal upper bounds in propositional logic (Q861253) ‎ (← links)
• Reasoning with minimal models: efficient algorithms and applications (Q1127346) ‎ (← links)
• Circumscribing DATALOG: expressive power and complexity (Q1127538) ‎ (← links)
• On the complexity of propositional knowledge base revision, updates, and counterfactuals (Q1199919) ‎ (← links)
• The complexity of model checking for circumscriptive formulae (Q1205713) ‎ (← links)
• The complexity of propositional closed world reasoning and circumscription (Q1329160) ‎ (← links)
• Cumulative default logic: Finite characterization, algorithms, and complexity (Q1337685) ‎ (← links)
• On compact representations of propositional circumscription (Q1391128) ‎ (← links)
• Reducing belief revision to circumscription (and vice versa) (Q1402725) ‎ (← links)
• Compiling specificity into approaches to nonmonotonic reasoning (Q1402752) ‎ (← links)
• Semantical and computational aspects of Horn approximations (Q1575175) ‎ (← links)
• The complexity of belief update (Q1575185) ‎ (← links)
• Default reasoning from conditional knowledge bases: Complexity and tractable cases (Q1589638) ‎ (← links)
• Fixed-parameter complexity in AI and nonmonotonic reasoning (Q1603733) ‎ (← links)
• On the computational complexity of assumption-based argumentation for default reasoning. (Q1852857) ‎ (← links)
• On the complexity of data disjunctions. (Q1853503) ‎ (← links)
• Preprocessing of intractable problems (Q1854544) ‎ (← links)
• A decision method for nonmonotonic reasoning based on autoepistemic reasoning (Q1891263) ‎ (← links)
• On the computational cost of disjunctive logic programming: Propositional case (Q1924780) ‎ (← links)
• Complexity of computing with extended propositional logic programs (Q1924783) ‎ (← links)
• On the decidability and complexity of reasoning about only knowing (Q1978243) ‎ (← links)
• An incremental algorithm for generating all minimal models (Q2457647) ‎ (← links)
• Theorem proving techniques for view deletion in databases (Q5927980) ‎ (← links)
• Closed world assumption for disjunctive reasoning (Q5959358) ‎ (← links)