Beyond NP: the QSAT phase transition
AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
A Computing Procedure for Quantification Theory
Journal of the ACM (JACM)
A machine program for theorem-proving
Communications of the ACM
Checking equivalence for partial implementations
Proceedings of the 38th annual Design Automation Conference
A Benchmark Method for the Propositional Modal Logics K, KT, S4
Journal of Automated Reasoning
Partial Implicit Unfolding in the Davis-Putnam Procedure for Quantified Boolean Formulae
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
Improvements to the Evaluation of Quantified Boolean Formulae
IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
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
A Distributed Algorithm to Evaluate Quantified Boolean Formulae
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Bounded Model Construction for Monadic Second-Order Logics
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
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
SAT-based planning in complex domains: concurrency, constraints and nondeterminism
Artificial Intelligence - special issue on planning with uncertainty and incomplete information
Reasoning under minimal upper bounds in propositional logic
Theoretical Computer Science
Models and quantifier elimination for quantified Horn formulas
Discrete Applied Mathematics
Ranking and Reputation Systems in the QBF Competition
AI*IA '07 Proceedings of the 10th Congress of the Italian Association for Artificial Intelligence on AI*IA 2007: Artificial Intelligence and Human-Oriented Computing
A solver for QBFs in negation normal form
Constraints
Testing Relativised Uniform Equivalence under Answer-Set Projection in the System cc T
Applications of Declarative Programming and Knowledge Management
Reasoning in Argumentation Frameworks Using Quantified Boolean Formulas
Proceedings of the 2006 conference on Computational Models of Argument: Proceedings of COMMA 2006
A Solver for QBFs in Nonprenex Form
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
Towards implementations for advanced equivalence checking in answer-set programming
ICLP'05 Proceedings of the 21st international conference on Logic Programming
cc⊤: a correspondence-checking tool for logic programs under the answer-set semantics
JELIA'06 Proceedings of the 10th European conference on Logics in Artificial Intelligence
Quantifier rewriting and equivalence models for quantified horn formulas
SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
Dependency quantified horn formulas: models and complexity
SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
| Hi-index | 0.00 |
This paper reports about the 2004 comparative evaluation of solvers for quantified Boolean formulas (QBFs), the second in a series of non-competitive events established with the aim of assessing the advancements in the field of QBF reasoning and related research. We evaluated sixteen solvers on a test set of about one thousand benchmarks selected from instances submitted to the evaluation and from those available at www.qbflib.org. In the paper we present the evaluation infrastructure, from the criteria used to select the benchmarks to the hardware set up, and we show different views about the results obtained, highlighting the strength of different solvers and the relative hardness of the benchmarks included in the test set.