research
∙
10/02/2019
TE-ETH: Lower Bounds for QBFs of Bounded Treewidth
The problem of deciding the validity (QSAT) of quantified Boolean formul...
share
research
∙
01/16/2014
Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution
We offer a new understanding of some aspects of practical SAT-solvers th...
research
∙
01/08/2013
Backdoors to Normality for Disjunctive Logic Programs
Over the last two decades, propositional satisfiability (SAT) has become...
research
∙
02/15/2012
The Good, the Bad, and the Odd: Cycles in Answer-Set Programs
Backdoors of answer-set programs are sets of atoms that represent clever...
research
∙
04/14/2011
