The mathematics of inheritance systems
The mathematics of inheritance systems
A graph-theoretic approach to default logic
Information and Computation
Reasoning with Incomplete Information
Reasoning with Incomplete Information
Propositional Logic: Deduction and Algorithms
Propositional Logic: Deduction and Algorithms
Complexity of argument-based default reasoning with specificity
AI Communications
Fixed-parameter tractability of disjunction-free default reasoning
Journal of Computer Science and Technology
Some Algorithms for Extension Computation of Nonmonotonic Rule Systems
Fundamenta Informaticae
Complexity of the Unique Extension Problem in Default Logic
Fundamenta Informaticae
Redundancy in logic II: 2CNF and Horn propositional formulae
Artificial Intelligence
Complexity of default logic on generalized conjunctive queries
LPNMR'07 Proceedings of the 9th international conference on Logic programming and nonmonotonic reasoning
| Hi-index | 0.00 |
This paper is concerned with the complexity of default reasoning with 2CNF default theories (D,W) in which W is a set of literals and D is a set of 2CNF defaults. It is proved that the problem whether a literal occurs in at least one extension can be solved in polynomial time. But the problem whether a literal appears in all extensions is proved to be co-NP-complete. The complexity of some subclasses of 2CNF default theories is also analyzed.