12 citations · 17 across the 9 of their papers we have counts for
4 papers · 1 filter
On Irrelevant Literals in Pseudo-Boolean Constraint Learning
Danel Le Berre, Pierre Marquis, Stefan Mengel +1
Learning pseudo-Boolean (PB) constraints in PB solvers exploiting cutting planes based inference is not as well understood as clause learning in conflict-driven clause learning sol…
Lower Bounds for Approximate Knowledge Compilation
Alexis de Colnet, Stefan Mengel
Knowledge compilation studies the trade-off between succinctness and efficiency of different representation languages. For many languages, there are known strong lower bounds on th…
QBF as an Alternative to Courcelle's Theorem
Michael Lampis, Stefan Mengel, Valia Mitsou
We propose reductions to quantified Boolean formulas (QBF) as a new approach to showing fixed-parameter linear algorithms for problems parameterized by treewidth. We demonstrate th…
Parameterized Compilation Lower Bounds for Restricted CNF-formulas
Stefan Mengel
We show unconditional parameterized lower bounds in the area of knowledge compilation, more specifically on the size of circuits in decomposable negation normal form (DNNF) that en…