Proceedings of the 38th annual Design Automation Conference
Algorithms for quantified Boolean formulas
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
An Algorithm to Evaluate Quantified Boolean Formulae and Its Experimental Evaluation
Journal of Automated Reasoning
Complexity results for structure-based causality
Artificial Intelligence
QUBOS: Deciding Quantified Boolean Logic Using Propositional Satisfiability Solvers
FMCAD '02 Proceedings of the 4th International Conference on Formal Methods in Computer-Aided Design
QUBE: A System for Deciding Quantified Boolean Formulas Satisfiability
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Journal of Symbolic Computation
Conflict driven learning in a quantified Boolean Satisfiability solver
Proceedings of the 2002 IEEE/ACM international conference on Computer-aided design
Learning for quantified boolean logic satisfiability
Eighteenth national conference on Artificial intelligence
Backjumping for quantified Boolean logic satisfiability
Artificial Intelligence
Expressing default abduction problems as quantified Boolean formulas
AI Communications
Weak, strong, and strong cyclic planning via symbolic model checking
Artificial Intelligence - special issue on planning with uncertainty and incomplete information
SAT-based planning in complex domains: concurrency, constraints and nondeterminism
Artificial Intelligence - special issue on planning with uncertainty and incomplete information
The description logic handbook
A satisfiability procedure for quantified boolean formulae
Discrete Applied Mathematics - The renesse issue on satisfiability
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
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
Strong planning under partial observability
Artificial Intelligence
A backjumping technique for disjunctive logic programming
AI Communications
Expressing default abduction problems as quantified Boolean formulas
AI Communications
Paraconsistent reasoning and preferential entailments by signed quantified Boolean formulae
ACM Transactions on Computational Logic (TOCL)
Boolean Functions as Models for Quantified Boolean Formulas
Journal of Automated Reasoning
On look-ahead heuristics in disjunctive logic programming
Annals of Mathematics and Artificial Intelligence
Generalizing consistency and other constraint properties to quantified constraints
ACM Transactions on Computational Logic (TOCL)
Task decomposition on abstract states, for planning under nondeterminism
Artificial Intelligence
Boolean Propagation Based on Literals for Quantified Boolean Formulae
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
Propositional fragments for knowledge compilation and quantified boolean formulae
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
CSP properties for quantified constraints: definitions and complexity
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
Conformant planning via symbolic model checking
Journal of Artificial Intelligence Research
Constructing conditional plans by a theorem-prover
Journal of Artificial Intelligence Research
Complexity of nested circumscription and abnormality theories
IJCAI'01 Proceedings of the 17th international joint 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
Planning in nondeterministic domains under partial observability via symbolic model checking
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
The second QBF solvers comparative evaluation
SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
QBF modeling: exploiting player symmetry for simplicity and efficiency
SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
Hi-index | 0.00 |