On the intertranslatability of non-monotonic logics
Annals of Mathematics and Artificial Intelligence
On the computational complexity of assumption-based argumentation for default reasoning
Artificial Intelligence
Nonmonotonic Logic Programming
IEEE Transactions on Knowledge and Data Engineering
Propositional default logics made easier: computational complexity of model checking
Theoretical Computer Science
Capturing Stationary and Regular Extensions with Reiter's Extensions
JELIA '00 Proceedings of the European Workshop on Logics in Artificial Intelligence
Nonmonotonic reasoning: towards efficient calculi and implementations
Handbook of automated reasoning
Expressing default abduction problems as quantified Boolean formulas
AI Communications
Complexity of argument-based default reasoning with specificity
AI Communications
Regular disjunction-free default theories
Journal of Computer Science and Technology
Theoretical Computer Science
Expressing default abduction problems as quantified Boolean formulas
AI Communications
Complexity of argument-based default reasoning with specificity
AI Communications
Complexity of the Unique Extension Problem in Default Logic
Fundamenta Informaticae
Implementing Prioritized Circumscription by Computing Disjunctive Stable Models
AIMSA '08 Proceedings of the 13th international conference on Artificial Intelligence: Methodology, Systems, and Applications
Preferred arguments are harder to compute than stable extensions
IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
Complexity of the Unique Extension Problem in Default Logic
Fundamenta Informaticae
Well-Founded Semantics for Default Logic
Fundamenta Informaticae
| Hi-index | 0.00 |