no code implementations • 28 May 2014 • Uwe Egly, Martin Kronegger, Florian Lonsing, Andreas Pfandler
Our results are the first empirical study of incremental QBF solving in the context of planning and motivate its use in other application domains.
2 code implementations • 9 Feb 2015 • Florian Lonsing, Uwe Egly
To this end, we equipped our incremental QBF solver DepQBF with a novel API to allow for incremental solving based on clause groups.
Logic in Computer Science
1 code implementation • 9 Apr 2018 • Florian Lonsing, Uwe Egly
We generalize the redundancy property in the QRAT system by QBF specific UP (QUP).
Logic in Computer Science
1 code implementation • 29 Apr 2019 • Florian Lonsing, Uwe Egly
QRATPre+ is the first implementation of these redundancy properties in QRAT and QRAT+ used to simplify QBFs in preprocessing.
Logic in Computer Science