@InProceedings{wimmer-et-al-sat-2015,
author = "Ralf Wimmer and Karina Gitina and Jennifer Nist and Christoph Scholl and Bernd Becker",
title = "Preprocessing for {DQBF}",
booktitle = "Proceedings of the 18\textsuperscript{th} International Conference on Theory and Applications of Satisfiability Testing (SAT)",
year = "2015",
month = sep,
series = "Lecture Notes in Computer Science",
volume = "9340",
pages = "1--18",
isbn = "978-3-319-24318-4",
doi = "10.1007/978-3-319-24318-4_13",
publisher = "Springer-Verlag",
editor = "Marijn Heule and Sean Weaver",
address = "Austin, TX, USA",
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.",
}