Name
Abstract | ||
|---|---|---|
In this paper, we propose the elimination of dependencies to convert a given dependency quantified Boolean formula (DQBF) to an equisatisfiable QBF. We show how to select a set of dependencies to eliminate such that we arrive at a smallest equisatisfiable QBF in terms of existential variables that is achievable using dependency elimination. This approach is improved by taking so-called don't-care dependencies into account, which result from the application of dependency schemes to the formula and can be added to or removed from the formula at no cost. We have implemented this new method in the state-of-the-art DQBF solver HQS. Experiments show that dependency elimination is clearly superior to the previous method using variable elimination. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1007/978-3-319-66263-3_21 | Lecture Notes in Computer Science |
Field | DocType | Volume |
Discrete mathematics,Variable elimination,Computer science,Algorithm,Solver,True quantified Boolean formula | Conference | 10491 |
ISSN | Citations | PageRank |
0302-9743 | 2 | 0.36 |
References | Authors | |
24 | 5 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ralf Wimmer | 1 | 407 | 34.28 |
| Andreas Karrenbauer | 2 | 133 | 20.21 |
| Ruben Becker | 3 | 31 | 5.27 |
| Christoph Scholl | 4 | 346 | 32.07 |
| B. Becker | 5 | 191 | 21.44 |