Abstract | ||
---|---|---|
Augmenting problem variables in a quantified Boolean formula with definition variables enables a compact representation in clausal form. Generally these definition variables are placed in the innermost quantifier level. To restore some structural information, we introduce a preprocessing technique that moves definition variables to the quantifier level closest to the variables that define them. We express the movement in the QRAT proof system to allow verification by independent proof checkers. We evaluated definition variable movement on the QBFEVAL' 20 competition benchmarks. Movement significantly improved performance for the competition's top solvers. Combining variable movement with the preprocessor BLOQQER improves solver performance compared to using BLOQQER alone. |
Year | DOI | Venue |
---|---|---|
2022 | 10.1007/978-3-030-99524-9_26 | TOOLS AND ALGORITHMS FOR THE CONSTRUCTION AND ANALYSIS OF SYSTEMS, TACAS 2022, PT I |
DocType | Volume | ISSN |
Conference | 13243 | 0302-9743 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Joseph E. Reeves | 1 | 0 | 0.34 |
Marijn J. H. Heule | 2 | 3 | 1.39 |
Randal E. Bryant | 3 | 9204 | 1194.64 |