The complexity of propositional closed world reasoning and circumscription
Journal of Computer and System Sciences
The complexity of logic-based abduction
Journal of the ACM (JACM)
Proof-complexity results for nonmonotonic reasoning
ACM Transactions on Computational Logic (TOCL)
Closed world assumption for disjunctive reasoning
Journal of Computer Science and Technology
Complexity and expressive power of logic programming
ACM Computing Surveys (CSUR)
Sequent calculi for propositional nonmonotonic logics
ACM Transactions on Computational Logic (TOCL)
Knowledge compilation = query rewriting + view synthesis
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Fixed-parameter complexity in AI and nonmonotonic reasoning
Artificial Intelligence
On the intertranslatability of non-monotonic logics
Annals of Mathematics and Artificial Intelligence
Characterizations of the Disjunctive Well-Founded Semantics: Confluent Calculi and Iterated GCWA
Journal of Automated Reasoning
On the computational complexity of assumption-based argumentation for default reasoning
Artificial Intelligence
On the complexity of data disjunctions
Theoretical Computer Science - Complexity and logic
Logic Programs for Querying Inconsistent Databases
PADL '03 Proceedings of the 5th International Symposium on Practical Aspects of Declarative Languages
Multiagent Compromises, Joint Fixpoints, and Stable Models
Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part I
JELIA '98 Proceedings of the European Workshop on Logics in Artificial Intelligence
Implementing Ordered Disjunction Using Answer Set Solvers for Normal Programs
JELIA '02 Proceedings of the European Conference on Logics in Artificial Intelligence
Fixed-Parameter Complexity in AI and Nonmonotonic Reasoning
LPNMR '99 Proceedings of the 5th International Conference on Logic Programming and Nonmonotonic Reasoning
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
On Proof Complexity of Circumscription
TABLEAUX '98 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Merge Path Improvements for Minimal Model Hyper Tableaux
TABLEAUX '99 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Towards First-Order Nonmonotonic Reasoning
LPNMR '99 Proceedings of the 5th International Conference on Logic Programming and Nonmonotonic Reasoning
Preprocessing of intractable problems
Information and Computation
Nonmonotonic reasoning: towards efficient calculi and implementations
Handbook of automated reasoning
Complexity and Expressive Power of Logic Programming
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
Expressing default abduction problems as quantified Boolean formulas
AI Communications
Database Repairs and Analytic Tableaux
Annals of Mathematics and Artificial Intelligence
Complexity of propositional nested circumscription and nested abnormality theories
ACM Transactions on Computational Logic (TOCL)
An incremental algorithm for generating all minimal models
Artificial Intelligence
A survey on knowledge compilation
AI Communications
Expressing default abduction problems as quantified Boolean formulas
AI Communications
Reasoning under minimal upper bounds in propositional logic
Theoretical Computer Science
Redundancy in logic III: Non-monotonic reasoning
Artificial Intelligence
Complexity of counting the optimal solutions
Theoretical Computer Science
Bounded treewidth as a key to tractability of knowledge representation and reasoning
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
The Complexity of Circumscriptive Inference in Post's Lattice
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
Incremental recompilation of knowledge
Journal of Artificial Intelligence Research
IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 1
The complexity of belief update
IJCAI'97 Proceedings of the 15th international joint conference on Artifical intelligence - Volume 1
IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
The comparative linguistics of knowledge representation
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Complexity of nested circumscription and abnormality theories
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Relating belief revision and circumscription
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2
An incremental algorithm for generating all minimal models
Artificial Intelligence
The computational complexity of ideal semantics
Artificial Intelligence
Bounded treewidth as a key to tractability of knowledge representation and reasoning
Artificial Intelligence
How to Complete an Interactive Configuration Process?
SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
On the complexity of theory curbing
LPAR'00 Proceedings of the 7th international conference on Logic for programming and automated reasoning
Proceedings of the 2nd international conference on Semantics in databases
Towards unifying semantic constraints and security constraints
Proceedings of the 2nd international conference on Semantics in databases
Counterexample guided abstraction refinement algorithm for propositional circumscription
JELIA'10 Proceedings of the 12th European conference on Logics in artificial intelligence
cmMUS: a tool for circumscription-based MUS membership testing
LPNMR'11 Proceedings of the 11th international conference on Logic programming and nonmonotonic reasoning
Abstraction-based algorithm for 2QBF
SAT'11 Proceedings of the 14th international conference on Theory and application of satisfiability testing
On deciding MUS membership with QBF
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
Transforming prioritized defaults and specificity into parallel defaults
UAI'95 Proceedings of the Eleventh conference on Uncertainty in artificial intelligence
A survey on statistical relational learning
AI'10 Proceedings of the 23rd Canadian conference on Advances in Artificial Intelligence
Living with inconsistency and taming nonmonotonicity
Datalog'10 Proceedings of the First international conference on Datalog Reloaded
Reducing Disjunctive to Non-Disjunctive Semantics by Shift-Operations
Fundamenta Informaticae
Approximating the Stable Model Semantics is Hard
Fundamenta Informaticae
Approximate Inference In Default Logic And Circumscription
Fundamenta Informaticae
Foundations of rule-based query answering
RW'07 Proceedings of the Third international summer school conference on Reasoning Web
On the tractability of minimal model computation for some CNF theories
Artificial Intelligence
| Hi-index | 5.23 |