【摘要】 课程安排问题是典型的组合优化和不确定调度问题。采用约束逻辑程序设计的研究方法,结合课程安排自身的特点,通过约束推理找到最优的课程安排结果。约束逻辑程序设计综合了人工智能中一致性算法和启发式搜索算法,采用约束推理方法,能非常好地处理各种冲突,并且能快速地排出合理的课程。更多还原

【Abstract】 Course timetabling is one typical NP-complete problem.With Constraint Logic Programming and feature of course timetabling,the best solution is found via constraint reasoning.Constraint logic programming,which integrates consistency algorithm and heuristic search algorithm and adopts constraint reasoning,can deal with various conflicts very well and quickly get one reasonable solution.更多还原