Expressively Modeling the Social Golfer Problem in SAT

被引：1

作者：

Lardeux, Frederic ^{[1
]}

Monfroy, Eric ^{[2
]}

机构：

[1] Univ Angers, Angers, France

[2] Univ Nantes, INRIA, LINA, TASC,UMR 6241, F-44035 Nantes, France

来源：

INTERNATIONAL CONFERENCE ON COMPUTATIONAL SCIENCE, ICCS 2015 COMPUTATIONAL SCIENCE AT THE GATES OF NATURE | 2015年 / 51卷

关键词：

Set Constraints; SAT Encoding; Social Golfer Problem; Constraint Programming; CSP;

D O I：

10.1016/j.procs.2015.05.252

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

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.

引用

页码：336 / 345

页数：10

共 50 条

[31] A GRASP for the Minimum Cost SAT Problem
Felici, Giovanni
Ferone, Daniele
Festa, Paola
Napoletano, Antonio
Pastore, Tommaso
LEARNING AND INTELLIGENT OPTIMIZATION (LION 11 2017), 2017, 10556 : 64 - 78
[32] An application of matroid theory to the SAT problem
Kullmann, O
15TH ANNUAL IEEE CONFERENCE ON COMPUTATIONAL COMPLEXITY, PROCEEDINGS, 2000, : 116 - 124
[33] A genetic algorithm for probabilistic SAT problem
Ognjanovic, Z
Midic, U
Kratica, J
ARTIFICIAL INTELLIGENCE AND SOFT COMPUTING - ICAISC 2004, 2004, 3070 : 462 - 467
[34] Modeling the determinants of a professional golfer's tournament earnings - A multiequation approach
Callan, Scott J.
Thomas, Janet M.
JOURNAL OF SPORTS ECONOMICS, 2007, 8 (04) : 394 - 411
[35] PROBABILISTICS ASPECTS OF THE SATISFACTION PROBLEM OF A BOOLEAN FORMULA - STUDY OF THE SAT, NUMBER-SAT AND MAX-SAT PROBLEMS
ANDRE, P
AI COMMUNICATIONS, 1995, 8 (01) : 54 - 55
[36] Convergence properties of optimization algorithms for the SAT problem
Gu, J
Gu, QP
Du, DZ
IEEE TRANSACTIONS ON COMPUTERS, 1996, 45 (02) : 209 - 219
[37] Personification annealing algorithm for solving SAT problem
Zhang, De-Fu
Huang, Wen-Qi
Wang, Hou-Xiang
Jisuanji Xuebao/Chinese Journal of Computers, 2002, 25 (02): : 148 - 152
[38] A novel method for all solutions SAT problem
Wang, Xiuqin
Ma, Guangsheng
Wang, Hao
PROCEEDINGS OF NINTH ACIS INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING, ARTIFICIAL INTELLIGENCE, NETWORKING AND PARALLEL/DISTRIBUTED COMPUTING, 2008, : 41 - +
[39] Fill-a-Pix Puzzle as a SAT Problem
Myat, Aye Myint
Htwe, Khine Khine
Funabiki, Nobuo
2019 INTERNATIONAL CONFERENCE ON ADVANCED INFORMATION TECHNOLOGIES (ICAIT), 2019, : 244 - 249
[40] A SAT approach for solving the staff transfer problem
Acharyya, S.
Bagchi, A.
IMECS 2008: INTERNATIONAL MULTICONFERENCE OF ENGINEERS AND COMPUTER SCIENTISTS, VOLS I AND II, 2008, : 64 - +

← 1 2 3 4 5 →