On kernels, defaults and even graphs
Annals of Mathematics and Artificial Intelligence
Comparing a Pair-Wise Compatibility Heuristic and Relaxed Stratification: Some Preliminary Results
ECSQARU '01 Proceedings of the 6th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Preferred Extensions of Argumentation Frameworks: Query Answering and Computation
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Complexity of argument-based default reasoning with specificity
AI Communications
Fixed-parameter tractability of disjunction-free default reasoning
Journal of Computer Science and Technology
Regular disjunction-free default theories
Journal of Computer Science and Technology
Complexity results for restricted credulous default reasoning
AI Communications
Complexity of argument-based default reasoning with specificity
AI Communications
Complexity Results for 2CNF Default Theories
Fundamenta Informaticae
A hierarchy of tractable subsets for computing stable models
Journal of Artificial Intelligence Research
Finding kernels or solving SAT
Journal of Discrete Algorithms
Complexity Results for 2CNF Default Theories
Fundamenta Informaticae
| Hi-index | 0.00 |