The complexity of propositional closed world reasoning and circumscription
Journal of Computer and System Sciences
Disjunctive Logic Programming: A Survey and Assessment
Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part I
On the Complexity of Model Checking and Inference in Minimal Models
LPNMR '01 Proceedings of the 6th International Conference on Logic Programming and Nonmonotonic Reasoning
The Inference Problem for Propositional Circumscription of Affine Formulas Is coNP-Complete
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Succinct Representations of Model Based Belief Revision
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
The Complexity of Minimal Satisfiability Problems
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Evaluation of an Algorithm for the Transversal Hypergraph Problem
WAE '99 Proceedings of the 3rd International Workshop on Algorithm Engineering
Preprocessing of intractable problems
Information and Computation
Measuring inconsistency in knowledge via quasi-classical models
Eighteenth national conference on Artificial intelligence
The complexity of minimal satisfiability problems
Information and Computation
The complexity of model checking for propositional default logics
Data & Knowledge Engineering
An incremental algorithm for generating all minimal models
Artificial Intelligence
Subtractive reductions and complete problems for counting complexity classes
Theoretical Computer Science - Mathematical foundations of computer science 2000
Reasoning under minimal upper bounds in propositional logic
Theoretical Computer Science
On the counting complexity of propositional circumscription
Information Processing Letters
Towards higher impact argumentation
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Trichotomy Results on the Complexity of Reasoning with Disjunctive Logic Programs
LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
Space efficiency of propositional knowledge representation formalisms
Journal of Artificial Intelligence Research
Model checking for nonmonotonic logics: algorithms and complexity
IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
An incremental algorithm for generating all minimal models
Artificial Intelligence
On the complexity of theory curbing
LPAR'00 Proceedings of the 7th international conference on Logic for programming and automated reasoning
On the Boolean connectivity problem for Horn relations
Discrete Applied Mathematics
Trichotomy and dichotomy results on the complexity of reasoning with disjunctive logic programs
Theory and Practice of Logic Programming
On the tractability of minimal model computation for some CNF theories
Artificial Intelligence
| Hi-index | 0.90 |