The mathematics of inheritance systems
The mathematics of inheritance systems
Hard problems for simple default logics
Artificial Intelligence - Special issue on knowledge representation
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
Default logic, propositional logic and constraints
AAAI'91 Proceedings of the ninth National conference on Artificial intelligence - Volume 1
The complexity of propositional default logics
AAAI'92 Proceedings of the tenth national conference on Artificial intelligence
Regular disjunction-free default theories
Journal of Computer Science and Technology
Complexity of argument-based default reasoning with specificity
AI Communications
Complexity of the Unique Extension Problem in Default Logic
Fundamenta Informaticae
Some Algorithms for Extension Computation of Nonmonotonic Rule Systems
Fundamenta Informaticae
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.