Formalizing nonmonotonic reasoning systems
Artificial Intelligence
A theory of diagnosis from first principles
Artificial Intelligence
Towards a theory of declarative knowledge
Foundations of deductive databases and logic programming
Hard problems for simple default logics
Artificial Intelligence - Special issue on knowledge representation
Default reasoning using classical logic
Artificial Intelligence
Complexity results for restricted credulous default reasoning
AI Communications
Rule Calculus: Semantics, Axioms and Applications
JELIA '08 Proceedings of the 11th European conference on Logics in Artificial Intelligence
The Complexity of Reasoning for Fragments of Default Logic
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Outlier detection using default logic
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Complexity of default logic on generalized conjunctive queries
LPNMR'07 Proceedings of the 9th international conference on Logic programming and nonmonotonic reasoning
Outlier detection for simple default theories
Artificial Intelligence
Simplifying diagnosis using LSAT: a propositional approach to reasoning from first principles
CPAIOR'05 Proceedings of the Second international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
| Hi-index | 0.00 |
We identify several new tractable subsets and several new intractable simple cases for reasoning in the propositional version of Reiter's default logic. The majority of our findings are related to brave reasoning. By making some intuitive observations, most classes that we identify can be derived quite easily from some subsets of default logic already known in the literature. Some of the subsets we discuss are subclasses of the so-called "extended logic programs". All the tractable subsets presented in this paper can be recognized in linear time.