The seventh QBF solvers evaluation (QBFEVAL’10)

Authors:
Claudia Peschiera;Luca Pulina;Armando Tacchella;Uwe Bubeck;Oliver Kullmann;Inês Lynce
Affiliations:
DIST, University of Genoa, Genova, Italy;DIST, University of Genoa, Genova, Italy;DIST, University of Genoa, Genova, Italy;Computer Science Inst., University of Paderborn, Paderborn, Germany;Computer Science Dept., Swansea University, Swansea, United Kingdom;INESC-ID/IST, Technical University of Lisbon, Lisbon, Portugal
Venue:
SAT'10 Proceedings of the 13th international conference on Theory and Applications of Satisfiability Testing
Year:
2010

Citing 16
Cited 9

Validating the result of a Quantified Boolean Formula (QBF) solver: theory and practice

Proceedings of the 2005 Asia and South Pacific Design Automation Conference
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
Treewidth: A Useful Marker of Empirical Hardness in Quantified Boolean Logic Encodings

LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
A solver for QBFs in negation normal form

Constraints
A self-adaptive multi-engine solver for quantified Boolean formulas

Constraints
Beyond CNF: A Circuit-Based QBF Solver

SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Efficiently Representing Existential Dependency Sets for Expansion-based QBF Solvers

Electronic Notes in Theoretical Computer Science (ENTCS)
The 3rd international planning competition: results and analysis

Journal of Artificial Intelligence Research
Clause/term resolution and learning in the evaluation of quantified Boolean formulas

Journal of Artificial Intelligence Research
A model for generating random quantified boolean formulas

IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
A structural approach to reasoning with quantified Boolean formulas

IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Minimal module extraction from DL-lite ontologies using QBF solvers

IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Nenofex: expanding NNF for QBF solving

SAT'08 Proceedings of the 11th international conference on Theory and applications of satisfiability testing
Exploiting structure in an AIG based QBF solver

Proceedings of the Conference on Design, Automation and Test in Europe
Resolve and expand

SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
Ranking function synthesis for bit-vector relations

TACAS'10 Proceedings of the 16th international conference on Tools and Algorithms for the Construction and Analysis of Systems

Logic-based ontology comparison and module extraction, with an application to DL-Lite

Artificial Intelligence
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
Antichain-based QBF solving

ATVA'11 Proceedings of the 9th international conference on Automated technology for verification and analysis
A uniform approach for generating proofs and strategies for both true and false QBF formulas

IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
Tracing SPLs precisely and efficiently

Proceedings of the 16th International Software Product Line Conference - Volume 1
Experiments with reduction finding

SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing
Model-theoretic inseparability and modularity of description logic ontologies

Artificial Intelligence
Advanced conflict-driven disjunctive answer set solving

IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we report about QBFEVAL’10, the seventh in a series of events established with the aim of assessing the advancements in reasoning about quantified Boolean formulas (QBFs). The paper discusses the results obtained and the experimental setup, from the criteria used to select QBF instances to the evaluation infrastructure. We also discuss the current state-of-the-art in light of past challenges and we envision future research directions that are motivated by the results of QBFEVAL’10.