21 citations · 54 across the 5 of their papers we have counts for
5 papers
Lower Bounds for QBFs of Bounded Treewidth
Johannes Klaus Fichte, Markus Hecher, Andreas Pfandler
The problem of deciding the validity (QSAT) of quantified Boolean formulas (QBF) is a vivid research area in both theory and practice. In the field of parameterized algorithmics, t…
Parameterized Complexity of Asynchronous Border Minimization
Robert Ganian, Martin Kronegger, Andreas Pfandler +1
Microarrays are research tools used in gene discovery as well as disease and cancer diagnostics. Two prominent but challenging problems related to microarrays are the Border Minimi…
Conformant Planning as a Case Study of Incremental QBF Solving
Uwe Egly, Martin Kronegger, Florian Lonsing +1
We consider planning with uncertainty in the initial state as a case study of incremental quantified Boolean formula (QBF) solving. We report on experiments with a workflow to incr…
Backdoors to Abduction
Andreas Pfandler, Stefan Rümmele, Stefan Szeider
Abductive reasoning (or Abduction, for short) is among the most fundamental AI reasoning methods, with a broad range of applications, including fault diagnosis, belief revision, an…
Computational Aspects of Nearly Single-Peaked Electorates
Gábor Erdélyi, Martin Lackner, Andreas Pfandler
Manipulation, bribery, and control are well-studied ways of changing the outcome of an election. Many voting rules are, in the general case, computationally resistant to some of th…