iDQ: Instantiation-Based DQBF Solving

14 pages•Published: July 28, 2014

Andreas Fröhlich, Gergely Kovásznai, Armin Biere and Helmut Veith

Abstract

Dependency Quantified Boolean Formulas (DQBF) are obtained by adding Henkin quantifiers to Boolean formulas and have seen growing interest in the last years. Since deciding DQBF is NEXPTIME-complete, efficient ways of solving it would have many practical applications. Still, there is only few work on solving this kind of formulas in practice. In this paper, we present an instantiation-based technique to solve DQBF efficiently. Apart from providing a theoretical foundation, we also propose a concrete implementation of our algorithm. Finally, we give a detailed experimental analysis evaluating our prototype iDQ on several DQBF as well as QBF benchmarks.

Keyphrases: dqbf, dqdimacs, epr, instantiation, qbf, sat

In: Daniel Le Berre (editor). POS-14. Fifth Pragmatics of SAT workshop, vol 27, pages 103-116.

Links:	https://easychair.org/publications/paper/PRV
	https://doi.org/10.29007/1s5k

BibTeX entry

@inproceedings{POS-14:iDQ_Instantiation_Based_DQBF,
  author    = {Andreas Fröhlich and Gergely Kovásznai and Armin Biere and Helmut Veith},
  title     = {iDQ: Instantiation-Based DQBF Solving},
  booktitle = {POS-14. Fifth Pragmatics of SAT workshop},
  editor    = {Daniel Le Berre},
  series    = {EPiC Series in Computing},
  volume    = {27},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {/publications/paper/PRV},
  doi       = {10.29007/1s5k},
  pages     = {103-116},
  year      = {2014}}

Download PDF Open PDF in browser