摘要
课程表问题是一个应用广泛、典型的组合优化和不确性调度问题,目前存在的求解算法多数缺乏声明性。一种基于回答集程序设计的TTP求解方法,可成功生成正确解集(答案),并用实验结果论证了算法的可行性。
Timetabling problem is a widely used,combinatorial optimization and scheduling problem.The existing algorithms are lacking in declarative nature,In order to seek the solution,Answer set programming is applied.In this paper,the aspect of pragmatic considerations as the needs of the university,constraints modeling as well as the result are considered,the experimental results demonstrate the feasibility of the algorithm.
出处
《桂林电子科技大学学报》
2010年第4期305-309,共5页
Journal of Guilin University of Electronic Technology
关键词
知识工程
知识表示
知识推理
ASP
TTP
knowledge engineering
knowledge representation
knowledge reasoning
answer set programming
timetabling problem.
