Name
Abstract | ||
|---|---|---|
For SAT and QBF formulas many techniques are applied in order to reduce/modify the number of variables and clauses of the formula, before the formula is passed to the actual solving algorithm. It is well known that these preprocessing techniques often reduce the computation time of the solver by orders of magnitude. In this paper we generalize different preprocessing techniques for SAT and QBF problems to dependency quantified Boolean formulas (DQBF) and describe how they need to be adapted to work with a DQBF solver core. We demonstrate their effectiveness both for CNF- and non-CNF-based DQBF algorithms. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1007/978-3-319-24318-4_13 | Lecture Notes in Computer Science |
Field | DocType | Volume |
Orders of magnitude (numbers),Discrete mathematics,Computer science,Algorithm,Conjunctive normal form,Preprocessor,Solver,True quantified Boolean formula,Computation | Conference | 9340 |
ISSN | Citations | PageRank |
0302-9743 | 8 | 0.51 |
References | Authors | |
36 | 5 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ralf Wimmer | 1 | 407 | 34.28 |
| karina gitina | 2 | 21 | 1.39 |
| Jennifer Nist | 3 | 8 | 0.51 |
| Christoph Scholl | 4 | 346 | 32.07 |
| Bernd Becker | 5 | 855 | 73.74 |