dependency schemes
Recently Published Documents


TOTAL DOCUMENTS

13
(FIVE YEARS 4)

H-INDEX

5
(FIVE YEARS 1)

Author(s):  
Olaf Beyersdorff ◽  
Mikoláš Janota ◽  
Florian Lonsing ◽  
Martina Seidl

Solvers for quantified Boolean formulas (QBF) have become powerful tools for tackling hard computational problems from various application domains, even beyond the scope of SAT. This chapter gives a description of the main algorithmic paradigms for QBF solving, including quantified conflict driven clause learning (QCDCL), expansion-based solving, dependency schemes, and QBF preprocessing. Particular emphasis is laid on the connections of these solving approaches to QBF proof systems: Q-Resolution and its variants in the case of QCDCL, expansion QBF resolution calculi for expansion-based solving, and QRAT for preprocessing. The chapter also surveys the relations between the various QBF proof systems and results on their proof complexity, thereby shedding light on the diverse performance characteristics of different solving approaches that are observed in practice.


Author(s):  
Ryszard Tuora ◽  
Adam Przepiórkowski ◽  
Aleksander Leczkowski
Keyword(s):  

2019 ◽  
Vol 65 ◽  
pp. 181-208 ◽  
Author(s):  
Tomáš Peitl ◽  
Friedrich Slivovsky ◽  
Stefan Szeider

Quantified 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.


2018 ◽  
Vol 63 (3) ◽  
pp. 597-623 ◽  
Author(s):  
Olaf Beyersdorff ◽  
Joshua Blinkhorn ◽  
Leroy Chew ◽  
Renate Schmidt ◽  
Martin Suda
Keyword(s):  

2018 ◽  
Vol 63 (1) ◽  
pp. 127-155 ◽  
Author(s):  
Tomáš Peitl ◽  
Friedrich Slivovsky ◽  
Stefan Szeider

2016 ◽  
Vol 612 ◽  
pp. 83-101 ◽  
Author(s):  
Friedrich Slivovsky ◽  
Stefan Szeider
Keyword(s):  

Author(s):  
Ralf Wimmer ◽  
Christoph Scholl ◽  
Karina Wimmer ◽  
Bernd Becker
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document