The complexity of logic-based abduction
Journal of the ACM (JACM)
Resolution for quantified Boolean formulas
Information and Computation
An algorithm to evaluate quantified Boolean formulae
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
A machine program for theorem-proving
Communications of the ACM
Deciding The Vapnik-Chervonenkis Dimension Is Sigma_3-Complete
CCC '96 Proceedings of the 11th Annual IEEE Conference on Computational Complexity
The equivalence problem for regular expressions with squaring requires exponential space
SWAT '72 Proceedings of the 13th Annual Symposium on Switching and Automata Theory (swat 1972)
Heuristics based on unit propagation for satisfiability problems
IJCAI'97 Proceedings of the 15th international joint conference on Artifical intelligence - Volume 1
Pushing the envelope: planning, propositional logic, and stochastic search
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 2
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
Beyond NP: Arc-Consistency for Quantified Constraints
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Towards a Symmetric Treatment of Satisfaction and Conflicts in Quantified Boolean Formula Evaluation
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
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
Strong planning under partial observability
Artificial Intelligence
Experimenting with look-back heuristics for hard ASP programs
LPNMR'07 Proceedings of the 9th international conference on Logic programming and nonmonotonic reasoning
On the complexity of theory curbing
LPAR'00 Proceedings of the 7th international conference on Logic for programming and automated reasoning
Bounded universal expansion for preprocessing QBF
SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
Abstraction-based algorithm for 2QBF
SAT'11 Proceedings of the 14th international conference on Theory and application of satisfiability testing
Failed literal detection for QBF
SAT'11 Proceedings of the 14th international conference on Theory and application of satisfiability testing
Solving hard ASP programs efficiently
LPNMR'05 Proceedings of the 8th international conference on Logic Programming and Nonmonotonic Reasoning
Equivalence models for quantified boolean formulas
SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
Planning under uncertainty and its applications
Reasoning, Action and Interaction in AI Theories and Systems
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
Parallel QBF Solving with Advanced Knowledge Sharing
Fundamenta Informaticae - RCRA 2009 Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion
On propositional QBF expansions and q-resolution
SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing
| Hi-index | 0.00 |
We present a theorem-prover for quantified Boolean formulae and evaluate it on random quantified formulae and formulae that represent problems from automated planning. Even though the notion of quantified Boolean formula is theoretically important, automated reasoning with QBF has not been thoroughly investigated. Universal quantifiers are needed in representing many computational problems that cannot be easily translated to the propositional logic and solved by satisfiability algorithms. Therefore efficient reasoning with QBF is important. The Davis-Putnam procedure can be extended to evaluate quantified Boolean formulae. A straightforward algorithm of this kind is not very efficient. We identify universal quantifiers as the main area where improvements to the basic algorithm can be made. We present a number of techniques for reducing the amount of search that is needed, and evaluate their effectiveness by running the algorithm on a collection of formulae obtained from planning and generated randomly. For the structured problems we consider, the techniques lead to a dramatic speed-up.