no code implementations • 2 Oct 2019 • Johannes Klaus Fichte, Markus Hecher, Andreas Pfandler
More formally, we establish lower bounds for QSAT and treewidth, namely, that under ETH there cannot be an algorithm that solves QSAT of quantifier depth i in runtime significantly better than i-fold exponential in the treewidth and polynomial in the input size.
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.
no code implementations • 22 Apr 2013 • Andreas Pfandler, Stefan Rümmele, Stefan Szeider
This complexity barrier rules out the existence of a polynomial transformation to propositional satisfiability (SAT).
