The Ninth QBF Solvers Evaluation - Preliminary Report
نویسنده
چکیده
In this paper we report about the 2016 competitive evaluation of quantified Boolean formulas (QBFs) solvers (QBFEVAL’16), the last in a series of events established with the aim of assessing the advancements in reasoning about QBFs. Aim of this preliminary report is to show at a glance design and results of QBFEVAL’16.
منابع مشابه
Challenges in the QBF Arena: the SAT'03 Evaluation of QBF Solvers
The implementation of effective reasoning tools for deciding the satisfiability of Quantified Boolean Formulas (QBFs) is an important issue in several research fields such as Formal Verification, Planning, and Reasoning about Knowledge. Several QBF solvers have been implemented in the last few years, most of them extending the well-known Davis, Putnam, Logemann, Loveland procedure (DPLL) for pr...
متن کاملReport of the Third QBF Solvers Evaluation
This paper reports about the 2005 comparative evaluation of solvers for quantified Boolean formulas (QBFs), the third 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 thirteen solvers on a test set of more than three thousands QBFs, selected from instances submitted to the evaluation and...
متن کاملA Symbolic Search Based Approach for Quantified Boolean Formulas
Solving Quantified Boolean Formulas (QBF) has become an important and attractive research area, since several problem classes might be formulated efficiently as QBF instances (e.g. planning, non monotonic reasoning, twoplayer games, model checking, etc). Many QBF solvers has been proposed, most of them perform decision tree search using the DPLL-like techniques. To set free the variable orderin...
متن کاملQBF Gallery 2014: The QBF Competition at the FLoC 2014 Olympic Games
The QBF Gallery 2014 was a competitive evaluation for QBF solvers organized as part of the FLoC 2014 Olympic Games during the Vienna Summer of Logic. The QBF Gallery 2014 featured three different tracks on formulas in prenex conjunctive normal form (PCNF) including more than 1200 formulas to be solved. Gold, silver, and bronze track medals were awarded to the solvers that solved the most formul...
متن کاملSolving QBF with Counterexample Guided Refinement
We propose two novel approaches for using CounterexampleGuided Abstraction Refinement (CEGAR) in Quantified Boolean Formula (QBF) solvers. The first approach develops a recursive algorithm whose search is driven by CEGAR (rather than by DPLL). The second approach employs CEGAR as an additional learning technique in an existing DPLL-based QBF solver. Experimental evaluation of the implemented pr...
متن کامل