Expressively Modeling the Social Golfer Problem in SAT

Abstract :

Constraint Satisfaction Problems allow one to expressively model problems. On the other hand, propositional satisfiability problem (SAT) solvers can handle huge SAT instances. We thus present a technique to expressively model set constraint problems and to encode them automatically into SAT instances. Our technique is expressive and less error-prone. We apply it to the Social Golfer Problem and to symmetry breaking of the problem.

Document type :
Conference papers
Complete list of metadatas
Contributor : Okina Université d'Angers <>
Submitted on : Tuesday, November 8, 2016 - 11:10:30 AM
Last modification on : Friday, May 10, 2019 - 12:50:14 PM

Links full text




Frédéric Lardeux, Eric Monfroy. Expressively Modeling the Social Golfer Problem in SAT. Computational Science at the Gates of Nature, 2015, Reykjavik, France. pp.336-345, ⟨10.1016/j.procs.2015.05.252⟩. ⟨hal-01393832⟩



Record views