qbf2epr: A Tool for Generating EPR Formulas from QBF

10 pages•Published: August 19, 2013

Martina Seidl, Florian Lonsing and Armin Biere

Abstract

We present the tool qbf2epr which translates quantified Boolean formulas (QBF) to
formulas in effectively propositional logic (EPR). The decision problem of QBF is the
prototypical problem for PSPACE, whereas EPR is NEXPTIME-complete. Thus QBF is
embedded in a formalism, which is potentially more succinct. The motivation for this workis twofold. On the one hand, our tool generates challenging benchmarks for EPR solvers.
On the other hand, we are interested in how EPR solvers perform compared to QBF solvers and if there are techniques implemented in EPR solvers which would also be valuable in QBF solvers and vice versa.

Keyphrases: effectively propositional logic, encoding, epr, qbf, quantified boolean formulas

In: Pascal Fontaine, Renate A. Schmidt and Stephan Schulz (editors). PAAR-2012. Third Workshop on Practical Aspects of Automated Reasoning, vol 21, pages 139-148.

Links:	https://easychair.org/publications/paper/nW
	https://doi.org/10.29007/2b5d

BibTeX entry

@inproceedings{PAAR-2012:qbf2epr_Tool_Generating_EPR,
  author    = {Martina Seidl and Florian Lonsing and Armin Biere},
  title     = {qbf2epr: A Tool for Generating EPR Formulas from QBF},
  booktitle = {PAAR-2012. Third Workshop on Practical Aspects of Automated Reasoning},
  editor    = {Pascal Fontaine and Renate A. Schmidt and Stephan Schulz},
  series    = {EPiC Series in Computing},
  volume    = {21},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {/publications/paper/nW},
  doi       = {10.29007/2b5d},
  pages     = {139-148},
  year      = {2013}}

Download PDF Open PDF in browser