Preprocessing for DQBF

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

Full description

Saved in:
Bibliographic Details
Published inTheory and Applications of Satisfiability Testing -- SAT 2015 Vol. 9340; pp. 173 - 190
Main Authors Wimmer, Ralf, Gitina, Karina, Nist, Jennifer, Scholl, Christoph, Becker, Bernd
Format Book Chapter
LanguageEnglish
Published Switzerland Springer International Publishing AG 2015
Springer International Publishing
SeriesLecture Notes in Computer Science
Subjects
Artificial intelligence
Boolean Formula
Computer science
Conjunctive Normal Form
Conjunctive Normal Form Formula
Mathematical theory of computation
Universal Expansion
Universal Variable
Online AccessGet full text
ISBN3319243179
9783319243177
ISSN0302-9743
1611-3349
DOI10.1007/978-3-319-24318-4_13

Cover

More Information
Summary: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.
Bibliography:This work was partly supported by the German Research Council (DFG) as part of the Transregional Collaborative Research Center AVACS (SFB/TR 14).
ISBN:3319243179
9783319243177
ISSN:0302-9743
1611-3349
DOI:10.1007/978-3-319-24318-4_13