QBFEVAL
QBF Solver Evaluation Portal. QBF Evaluations are a series of yearly events with the purpose of assessing the state of the art in the field of QBF solvers and QBF-based applications. Up to the third event in the series, the evaluation was run on a non-competitive basis, i.e., there were no winners and losers. Starting from 2006, QBFEVAL becomes a competitive event. 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 as test instances for the evaluation. People thinking about QBF-based techniques in their area (e.g., formal verification, planning, knowledge reasoning) are invited to contribute to the evaluation by submitting QBF instances of their research problems.
Keywords for this software
References in zbMATH (referenced in 4 articles , 1 standard article )
Showing results 1 to 4 of 4.
Sorted by year (- Pulina, Luca; Seidl, Martina: The 2016 and 2017 QBF solvers evaluations (QBFEVAL’16 and QBFEVAL’17) (2019)
- Sutcliffe, Geoff: The TPTP problem library and associated infrastructure. From CNF to TH0, TPTP v6.4.0 (2017)
- Pulina, Luca; Tacchella, Armando: A self-adaptive multi-engine solver for quantified Boolean formulas (2009)
- Narizzano, Massimo; Pulina, Luca; Tacchella, Armando: The QBFEVAL web portal (2006) ioport