12 citations · 38 across the 5 of their papers we have counts for
Showing 2013Show all
3 papers · 1 filter
cs.CC2013★ 6 cited
Trading inference effort versus size in CNF Knowledge Compilation
Matthew Gwynne, Oliver Kullmann
Knowledge Compilation (KC) studies compilation of boolean functions f into some formalism F, which allows to answer all queries of a certain kind in polynomial time. Due to its rel…
cs.CC2013★ 9 cited
On SAT representations of XOR constraints
Matthew Gwynne, Oliver Kullmann
We study the representation of systems S of linear equations over the two-element field (aka xor- or parity-constraints) via conjunctive normal forms F (boolean clause-sets). First…
cs.AI2013★ 7 cited
Towards a theory of good SAT representations
Matthew Gwynne, Oliver Kullmann
We aim at providing a foundation of a theory of "good" SAT representations F of boolean functions f. We argue that the hierarchy UC_k of unit-refutation complete clause-sets of lev…