Name
Abstract | ||
|---|---|---|
AbstractQuantified Boolean Formulas (QBFs) can be used to succinctly encode problems from domains such as formal verification, planning, and synthesis. One of the main approaches to QBF solving is Quantified Conflict Driven Clause Learning (QCDCL). By default, QCDCL assigns variables in the order of their appearance in the quantifier prefix so as to account for dependencies among variables. Dependency schemes can be used to relax this restriction and exploit independence among variables in certain cases, but only at the cost of nontrivial interferences with the proof system underlying QCDCL. We introduce dependency learning, a new technique for exploiting variable independence within QCDCL that allows solvers to learn variable dependencies on the fly. The resulting version of QCDCL enjoys improved propagation and increased flexibility in choosing variables for branching while retaining ordinary (long-distance) Q-resolution as its underlying proof system. We show that dependency learning can achieve exponential speedups over ordinary QCDCL. Experiments on standard benchmark sets demonstrate the effectiveness of this technique. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1613/jair.1.11529 | Hosted Content |
Field | DocType | Volume |
Discrete mathematics,Conflict-Driven Clause Learning,ENCODE,Computer science,On the fly,Prefix,Exploit,Theoretical computer science,Branching (version control),Formal verification | Conference | 65 |
Issue | ISSN | Citations |
1 | 1076-9757 | 3 |
PageRank | References | Authors |
0.39 | 28 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Tomás Peitl | 1 | 6 | 4.82 |
| Friedrich Slivovsky | 2 | 62 | 7.96 |
| Stefan Szeider | 3 | 1341 | 99.97 |