|
|||||
|
|
$${\varvec{teaspoon}}$$ : solving the curriculum-based course timetabling problems with answer set programming |
|
| Authors: | Banbara Mutsunori Inoue Katsumi Kaufmann Benjamin Okimoto Tenda Schaub Torsten Soh Takehide Tamura Naoyuki Wanko Philipp |
| Institution: | 1.Kobe University, 1-1 Rokko-dai, Nada-ku, Kobe, Hyogo, 657-8501, Japan ;2.National Institute of Informatics, 2-1-2 Hitotsubashi, Chiyoda-ku, Tokyo, 101-8430, Japan ;3.Universität Potsdam, August-Bebel-Strasse 89, 14482, Potsdam, Germany ;4.Inria – Centre de Rennes Bretagne Atlantique, Rennes, France ;5.Tokyo Institute of Technology, 2-12-1 Ookayama, Meguro-ku, Tokyo, 152-8550, Japan ; |
| Abstract: | Annals of Operations Research - Answer Set Programming (ASP) is an approach to declarative problem solving, combining a rich yet simple modeling language with high performance solving capacities.... |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ | |