10 citations · 30 across the 15 of their papers we have counts for
Showing 2013Show all
3 papers · 1 filter
cs.CC2013★ 6 cited
The Parameterized Complexity of Reasoning Problems Beyond NP
Ronald de Haan, Stefan Szeider
Today's propositional satisfiability (SAT) solvers are extremely powerful and can be used as an efficient back-end for solving NP-complete problems. However, many fundamental probl…
cs.AI2013
Parameterized Complexity Results for Plan Reuse
Ronald de Haan, Anna Roubíčková, Stefan Szeider
Planning is a notoriously difficult computational problem of high worst-case complexity. Researchers have been investing significant efforts to develop heuristics or restrictions t…
cs.CC2013★ 4 cited
Local Backbones
Ronald de Haan, Iyad Kanj, Stefan Szeider
A backbone of a propositional CNF formula is a variable whose truth value is the same in every truth assignment that satisfies the formula. The notion of backbones for CNF formulas…