Set Constraint Model and Automated Encoding into SAT: Application to the Social Golfer Problem

Frédéric Lardeux, Eric Monfroy, Broderick Crawford +1

On the one hand, Constraint Satisfaction Problems allow one to declaratively model problems. On the other hand, propositional satisfiability problem (SAT) solvers can handle huge S…