Today a theory of good "SAT representations"

Oliver Kullmann

(Swansea University)

"Encoding" a problem as a SAT problem, that's now a "standard" method, due to decent SAT solvers available. But what does it really mean, to represent a problem in propositional logic? As experience shows, the representation can be crucial. Some fragments of a theory of "good SAT representations", based on complexity measures for resolution, will be discussed in my talk (at a basic level).
Thursday 25th February 2016, 15:00
Robert Recorde Room
Department of Computer Science