首页> 外文期刊>Expert Systems with Application >Parallelizing a CLIPS-based course timetabling expert system
【24h】

Parallelizing a CLIPS-based course timetabling expert system

机译:并行基于CLIPS的课程时间表专家系统

获取原文
获取原文并翻译 | 示例

摘要

Course timetabling is a complex task that cannot be achieved using only a few general principles. This work integrates expert systems and constraint programming to generate a novel artificial intelligence approach for a course timetabling system. This approach can be easily reformulated and customized to sup-port requirement changes. Furthermore, the difference between hard and soft constraints can be also addressed easily. However, achieving a feasible timetable is very time consuming because the inference engine is CLIPS-based. Notably, CLIPS is a rule-based language that relies on the repeated matching of facts with rules to generate conclusions. To overcome the problem, this work parallelizes the execution of the timetabling system in emerging cluster systems. However, scheduling courses in parallel without solving assignment conflicts is difficult. To conquer the inherent serialization of the inference of course timetabling, courses are scheduled one by one and the schedule for one course is parallelized. This work utilizes the inference process for scheduling one course that behaves similar to the nested if-then-else structure. The rules for the inference process of scheduling one course are partitioned into multiple rule clusters, where each rule cluster is inferred by a slave process. After receiving all feasible solutions generated by slave processes, the master decides which solution to adopt for a current course according to rule priorities. However, improper division of rules can result in a false conclusion or runtime errors. To ensure that a correct timetable is obtained, two possible problems caused by improper rule division are identified. Three partitioning guidelines are then used to cope with these problems. For implementation, this work applied a novel programming model that transmits facts in C and infers rules in CLIPS. Experimental results demonstrate that the proposed parallel timetabling system achieves superlinear speedup when running in a cluster system. The proposed method also helps parallelize CLIPS-based expert systems that have similar inference behavior to that in the course timetabling system.
机译:课程时间表设置是一项复杂的任务,仅使用一些通用原则是无法实现的。这项工作将专家系统和约束编程集成在一起,为课程时间表系统生成了一种新颖的人工智能方法。可以轻松地重新构造和定制此方法以支持需求变更。此外,硬约束和软约束之间的差异也可以轻松解决。但是,由于推理引擎是基于CLIPS的,因此要实现可行的时间表非常耗时。值得注意的是,CLIPS是一种基于规则的语言,它依赖于事实与规则的重复匹配以得出结论。为了克服这个问题,这项工作并行化了新兴集群系统中的时间表系统的执行。但是,很难在不解决分配冲突的情况下并行安排课程。为了克服课程时间表推论的内在序列化,课程被一个一个地安排,一个课程的安排被并行化。这项工作利用推理过程来安排行为类似于嵌套的if-then-else结构的一门课程。安排一门课程的推理过程的规则被划分为多个规则簇,其中每个规则簇都由从属过程来推理。主机收到从属进程生成的所有可行解决方案后,将根据规则优先级来决定针对当前课程采用哪种解决方案。但是,不正确的规则划分会导致错误的结论或运行时错误。为了确保获得正确的时间表,确定了由于规则划分不当而导致的两个可能的问题。然后使用三个分区指南来解决这些问题。为了实现,这项工作应用了一种新颖的编程模型,该模型在C中传输事实并在CLIPS中推断规则。实验结果表明,所提出的并行时间表系统在集群系统中运行时可以实现超线性加速。所提出的方法还有助于并行化基于CLIPS的专家系统,该专家系统具有与课程时间表系统相似的推理行为。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号