Search Results for author:
Found 4 papers, 0 papers with code
Backdoors to Tractable Answer-Set Programming
We demonstrate how backdoors can serve as a unifying framework that accommodates several tractable restrictions of ASP known from the literature.
Backdoors to Normality for Disjunctive Logic Programs
One cannot transform these two reasoning problems into SAT in polynomial time, unless the Polynomial Hierarchy collapses.
Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution
We offer a new understanding of some aspects of practical SAT-solvers that are based on DPLL with unit-clause propagation, clause-learning, and restarts.
Lower Bounds for QBFs of Bounded Treewidth
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.
