Expressively Modeling the Social Golfer Problem in SAT - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2015

Expressively Modeling the Social Golfer Problem in SAT

Résumé

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.

Dates et versions

hal-01393832 , version 1 (08-11-2016)

Identifiants

Citer

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⟩
168 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Mastodon Facebook X LinkedIn More