Searching for "Complexity Results for Nonmonotonic Logics." – sorted by Relevance.
-
Complexity Results for Disjunctive Logic Programming and Application to Nonmonotonic Logics
- the polynomial hierarchy. The results have applications to nonmonotonic logics and provide new complexity results
- Cited by 23 (2 self) – Add To MetaCart
-
On the Computational Cost of Disjunctive Logic Programming: Propositional Case
- on complexity results for nonmonotonic reasoning and logic programming [12, 59]. By the work of Apt, Blair
- Cited by 78 (27 self) – Add To MetaCart
-
Representing Paraconsistent Reasoning via Quantified Propositional Logic
- -completeness results, or [36, 30] for complexity results for nonmonotonic logics which reside on the second level
- Cited by 4 (3 self) – Add To MetaCart
-
Automated Deduction: A Technological Point of View
- results of nonmonotonic logics are located on the second level of the polynomial hierarchy [26], so
- Cited by 1 (0 self) – Add To MetaCart

