Download PDFOpen PDF in browserqbf2epr: A Tool for Generating EPR Formulas from QBF10 pages•Published: August 19, 2013AbstractWe present the tool qbf2epr which translates quantified Boolean formulas (QBF) toformulas 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.
|