Expressively Modeling the Social Golfer Problem in SAT | Zendy

Frédéric Lardeux | Zendy; Éric Monfroy | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Expressively Modeling the Social Golfer Problem in SAT

Author(s) -

Frédéric Lardeux,

Éric Monfroy

Publication year - 2015

Publication title -

procedia computer science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.334

H-Index - 76

ISSN - 1877-0509

DOI - 10.1016/j.procs.2015.05.252

Subject(s) - constraint satisfaction problem , satisfiability , constraint (computer aided design) , boolean satisfiability problem , computer science , set (abstract data type) , encode , propositional calculus , maximum satisfiability problem , theoretical computer science , constraint satisfaction , mathematical optimization , algorithm , mathematics , artificial intelligence , programming language , boolean function , biochemistry , chemistry , geometry , probabilistic logic , gene

International audience

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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research