Search Results for author: Andreas Pfandler

Found 3 papers, 0 papers with code

Lower Bounds for QBFs of Bounded Treewidth

no code implementations2 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.

Conformant Planning as a Case Study of Incremental QBF Solving

no code implementations28 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.

Backdoors to Abduction

no code implementations22 Apr 2013 Andreas Pfandler, Stefan Rümmele, Stefan Szeider

This complexity barrier rules out the existence of a polynomial transformation to propositional satisfiability (SAT).

Cannot find the paper you are looking for? You can Submit a new open access paper.