203 citations · 322 across the 18 of their papers we have counts for
Showing 2014Show all
2 papers · 1 filter
math.CO2014★ 8 cited
Bounds for variables with few occurrences in conjunctive normal forms
Oliver Kullmann, Xishun Zhao
We investigate connections between SAT (the propositional satisfiability problem) and combinatorics, around the minimum degree (number of occurrences) of variables in various forms…
cs.CC2014★ 4 cited
A framework for good SAT translations, with applications to CNF representations of XOR constraints
Matthew Gwynne, Oliver Kullmann
We present a general framework for good CNF-representations of boolean constraints, to be used for translating decision problems into SAT problems (i.e., deciding satisfiability fo…