QBFEVAL'18 - Call for Contributions
CALL FOR CONTRIBUTIONS
QBFEVAL'18 - Competitive Evaluation of QBF Solvers
A joint event with the 21st Int. Conference on Theory and Applications of Satisfiability Testing (SAT) (affiliated with FLoC 2018)
Oxford, UK | July 9 - July 12 2018 | http://www.qbflib.org/
QBFEVAL'18 is the 2018 competitive evaluation of QBF solvers, and the thirteenth evaluation of QBF solvers and instances ever. QBFEVAL'18 awards solvers that stand out as being particularly effective on specific categories of QBF instances.
We warmly encourage developers of QBF solvers to submit their work, even at early stages of development, as long as it fulfills some very simple requirements.
We also welcome the submission of QBF formulas to be used for the evaluation. Researchers thinking about using QBF-based techniques in their area (e.g., formal verification, planning, knowledge representation & reasoning) are invited to contribute to the evaluation by submitting QBF instances of their research problems (see the requirements for instances). The results of the evaluation will be a good indicator of the current feasibility of QBF-based approaches and a stimulus for people working on QBF solvers to further enhance their tools.
Details about solvers and benchmarks submission, tracks, and related rules, are available at http://www.qbflib.org/qbfeval18.php
For questions, comments and any other issue regarding QBFEVAL'18, please get in touch with the organizers via qbf18@qbflib.org.
Important Dates
- Registration open: March 14 (for all tracks)
- Registration close: April 7
- Solvers and Benchmarks due: April 14 (for all tracks except Hard-Instances Track)
- First stage results: April 30
- Second stage solvers due: May 10 (for all tracks except Hard-Instances Track)
- Hard instances solver due: June 1
- Competition Benchmarks available for download: June 14
- Final results: presented at SAT'18
Organizing committee
Organization
- Luca Pulina, University of Sassari
- Martina Seidl, Johannes Kepler Universitat Linz
Judges
- Olaf Beyersdorff, University of Leeds
- Christoph Wintersteiger, Microsoft Research Limited