Acta Informatica
Probabilistic semantics for nonmonotonic reasoning: a survey
Proceedings of the first international conference on Principles of knowledge representation and reasoning
A catalog of complexity classes
Handbook of theoretical computer science (vol. A)
Qualitative probabilities for default reasoning, belief revision, and causal modeling
Artificial Intelligence
Default reasoning from conditional knowledge bases: complexity and tractable cases
Artificial Intelligence
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Introduction to Algorithms
Nonmonotonic reasoning: from complexity to algorithms
Annals of Mathematics and Artificial Intelligence
A Maximum Entropy Approach to Nonmonotonic Reasoning
IEEE Transactions on Pattern Analysis and Machine Intelligence
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
System Z: a natural ordering of defaults with tractable applications to nonmonotonic reasoning
TARK '90 Proceedings of the 3rd conference on Theoretical aspects of reasoning about knowledge
| Hi-index | 0.00 |
This paper refines the tractability/intractability frontier of default reasoning from conditional knowledge bases. It presents two new tractable cases with relation to lexicographic entailment. In particular, we have introduced nested conditional knowledge bases and co-nested conditional knowledge bases, which are meaningful conditional knowledge bases. Both tractable classes presented in this paper can be recognized in linear time.