[Zurück]

M. Seidl, F. Lonsing, A. Biere:
"qbf2epr: A Tool for Generating EPR Formulas from QBF";
Vortrag: Third Workshop on Practical Aspects of Automated Reasoning, Manchester; 30.06.2012 - 01.07.2012; in: "Proceedings of PAAR 2012", P. Fontaine, R. Schmidt, S. Schulz (Hrg.); (2012), 8 S.

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 work is 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. Furthermore, we provide an improved encoding of QBF in EPR based on dependency schemes which are a powerful concept in QBF solving.

QBF, EPR

http://www.eprover.org/EVENTS/PAAR-2012/PAAR2012.pdf

Projektleitung Martina Seidl:
FAME: Formalisierung und Handhabung von Evolution in modellbasierter Softwareentwicklung