Constraint-based timetabling - a case study

被引:3
作者
Abbas, AM [1 ]
Tsang, EPK [1 ]
机构
[1] Univ Balamand, Dept Comp Sci, Tripoli, Lebanon
来源
ACS/IEEE INTERNATIONAL CONFERENCE ON COMPUTER SYSTEMS AND APPLICATIONS, PROCEEDINGS | 2001年
关键词
Constraint-Satisfaction; timetabling; software engineering;
D O I
10.1109/AICCSA.2001.933953
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
This paper reports a case study in applying Constraint-Satisfaction techniques to university and school timetabling. It involves the construction of a substantial, carefully specified, fully tested and fully operational system. The software engineering aspect of Constraint-Satisfaction is emphasized in this paper. Constraint-Satisfaction problems are expressed in a language more familiar to the formal software engineering community. This brings Constraint-Satisfaction one step closer to formal specification, program verification and transformation; issues extensively studied in software engineering. In problem formulation, explicit domain constraints and heuristic information are made explicit. Moreover, the user's needs are considered more closely; for instance, when the program fails to find a solution, useful indications are produced to help in relaxation or reformulation of the problem.
引用
收藏
页码:67 / 72
页数:4
相关论文
共 13 条
  • [1] ABBAS A, 2001, CP AI OR 01 APR
  • [2] [Anonymous], 1993, FDN CONSTRAINT SATIS
  • [3] BURKE E, 1996, SPRINGER LECT NOTES
  • [4] BURKE E, 1998, SPRINGER LECT NOTES
  • [5] FLENER P, 2001, PADL 01 PRACT ASP DE
  • [6] Gaschnig J., 1978, P 2 NAT C CAN SOC CO, P19
  • [7] GINSBERG ML, 1993, ARTIFICIAL INTELLIGE, V1
  • [8] HNICH B, 2001, JFPLC 01
  • [9] REIS LP, 2000, PATAT2000 P AUG
  • [10] TRICK MA, 2000, PATAT2000 P AUG