Complexity results for structure-based causality
Artificial Intelligence
Encodings for Equilibrium Logic and Logic Programs with Nested Expressions
EPIA '01 Proceedings of the10th Portuguese Conference on Artificial Intelligence on Progress in Artificial Intelligence, Knowledge Extraction, Multi-agent Systems, Logic Programming and Constraint Solving
ICLP '02 Proceedings of the 18th International Conference on Logic Programming
Partial Implicit Unfolding in the Davis-Putnam Procedure for Quantified Boolean Formulae
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
On Computing Solutions to Belief Change Scenarios
ECSQARU '01 Proceedings of the 6th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Modal Nonmonotonic Logics Revisited: Efficient Encodings for the Basic Reasoning Tasks
TABLEAUX '02 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Lemma and Model Caching in Decision Procedures for Quantified Boolean Formulas
TABLEAUX '02 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
An Analysis of Backjumping and Trivial Truth in Quantified Boolean Formulas Satisfiability
AI*IA 01 Proceedings of the 7th Congress of the Italian Association for Artificial Intelligence on Advances in Artificial Intelligence
QUBE: A System for Deciding Quantified Boolean Formulas Satisfiability
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Paraconsistent Reasoning via Quantified Boolean Formulas, I: Axiomatising Signed Systems
JELIA '02 Proceedings of the European Conference on Logics in Artificial Intelligence
Learning for quantified boolean logic satisfiability
Eighteenth national conference on Artificial intelligence
Backjumping for quantified Boolean logic satisfiability
Artificial Intelligence
The Aircraft Sequencing Problem
Computer Science in Perspective
Expressing default abduction problems as quantified Boolean formulas
AI Communications
A logic programming approach to knowledge-state planning: Semantics and complexity
ACM Transactions on Computational Logic (TOCL)
Complexity results for explanations in the structural-model approach
Artificial Intelligence
SAT-Based Techniques in System Synthesis
DATE '03 Proceedings of the conference on Design, Automation and Test in Europe - Volume 1
On Deciding Subsumption Problems
Annals of Mathematics and Artificial Intelligence
Complexity of propositional nested circumscription and nested abnormality theories
ACM Transactions on Computational Logic (TOCL)
Computational methods for database repair by signed formulae*
Annals of Mathematics and Artificial Intelligence
Expressing default abduction problems as quantified Boolean formulas
AI Communications
Boolean Functions as Models for Quantified Boolean Formulas
Journal of Automated Reasoning
PaQuBE: Distributed QBF Solving with Advanced Knowledge Sharing
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Propositional fragments for knowledge compilation and quantified boolean formulae
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
Backjumping for quantified Boolean logic satisfiability
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
On the complexity of theory curbing
LPAR'00 Proceedings of the 7th international conference on Logic for programming and automated reasoning
On deciding MUS membership with QBF
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
Solving hard ASP programs efficiently
LPNMR'05 Proceedings of the 8th international conference on Logic Programming and Nonmonotonic Reasoning
The second QBF solvers comparative evaluation
SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
A branching heuristics for quantified renamable horn formulas
SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
Representing paraconsistent reasoning via quantified propositional logic
Inconsistency Tolerance
Embedding memoization to the semantic tree search for deciding QBFs
AI'04 Proceedings of the 17th Australian joint conference on Advances in Artificial Intelligence
sQueezeBF: an effective preprocessor for QBFs based on equivalence reasoning
SAT'10 Proceedings of the 13th international conference on Theory and Applications of Satisfiability Testing
An overview of parallel SAT solving
Constraints
Parallel QBF Solving with Advanced Knowledge Sharing
Fundamenta Informaticae - RCRA 2009 Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion
| Hi-index | 0.00 |