Name
Abstract | ||
|---|---|---|
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 from those available at www.qbflib.org. In the paper we present the evaluation infrastructure, from the criteria used to assemble the test set to the hardware set up, and we show dierent views about the results obtained, highlighting the strength of dierent solvers and the relative hardness of the instances included in the test set. |
Year | Venue | Keywords |
|---|---|---|
2006 | JSAT | automated reasoning tools,empirical evaluation,quantie d boolean formulas,automated reasoning |
Field | DocType | Volume |
Discrete mathematics,Theoretical computer science,Mathematics,Test set | Journal | 2 |
Issue | Citations | PageRank |
1-4 | 13 | 0.85 |
References | Authors | |
20 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Massimo Narizzano | 1 | 451 | 30.41 |
| Luca Pulina | 2 | 326 | 37.95 |
| Armando Tacchella | 3 | 1448 | 108.82 |