Name
Abstract | ||
|---|---|---|
This paper reports about the 2004 comparative evaluation of solvers for quantified Boolean formulas (QBFs), the second 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 sixteen solvers on a test set of about one thousand benchmarks 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 select the benchmarks to the hardware set up, and we show different views about the results obtained, highlighting the strength of different solvers and the relative hardness of the benchmarks included in the test set. |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1007/11527695_28 | SAT (Selected Papers |
Keywords | Field | DocType |
different view,sixteen solvers,boolean formula,qbf reasoning,thousand benchmarks,different solvers,test set,comparative evaluation,paper report,qbf solvers,evaluation infrastructure | Constraint satisfaction,Computer science,Satisfiability,Theoretical computer science,Boolean algebra,Artificial intelligence,True quantified Boolean formula,Machine learning,Test set | Conference |
Volume | ISSN | ISBN |
3542 | 0302-9743 | 3-540-27829-X |
Citations | PageRank | References |
12 | 0.65 | 20 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Daniel Le Berre | 1 | 681 | 41.26 |
| Massimo Narizzano | 2 | 451 | 30.41 |
| Laurent Simon | 3 | 746 | 43.15 |
| Armando Tacchella | 4 | 1448 | 108.82 |