期刊文献+

基于回答集程序的排课系统设计与实现 被引量:5

Timetabling System Design and Implementation Using Answer Set Programming
下载PDF
导出
摘要 排课问题是典型的组合优化和NP完全问题。一个好的排课系统既需要能高效地求解排课问题,也需要能提供灵活的定义各种用户约束的方式,但现有的排课系统通常不能同时兼顾这两点。通过实现一个基于回答集程序的排课系统,较好地解决了这一问题。系统的前端接受用户的各种约束条件,并将其转换为回答集程序,后端调用回答集求解器实现排课问题的求解。实验表明,这种实现方式能适应排课条件的变化,具有灵活和可扩展的特点,并在可接受的时间内能排出教师满意度较高的课表。 Timetabling problem is a typical combinatorial optimization problem as well as a NP-complete problem.A good timetabling system needs not only the efficiency in timetabling solving but also the flexibility in definning user constraints.However,the systems at present usually can't deal with these two points at the same time.In this paper,realize a better timetabling system based on answer set programming.The system's Front-End receives various constraints before transforming them into answer set program.The Back-End solves timetabling problem through answer set solver.The experimental results show us that it can arrange a satisfied timetable in an acceptable time because of its flexibility and scalability.
出处 《计算机技术与发展》 2010年第6期228-232,共5页 Computer Technology and Development
基金 国家自然科学基金(NSFC60703095) 广东省自然科学基金(GDSF07300237)
关键词 回答集 排课 约束 answer set timetabling constraint
  • 相关文献

参考文献11

  • 1Even S,Itai A,Shamir A.On the compexity of timetable and multicommodity flow prlblems[J].SIAM J.of Computing,1976(4):691-703.
  • 2Cooper T B,Kingston J H.The complexity of timetable con-struction problems[C] //Proc.ICPTAT'95.New Orleans,Loisiana,United States:[s.n.].1995:183-295.
  • 3Gueret C,Jussien N.Building university timetables using con-straint logic programming[J].Information and Computation,1995(8):12-23.
  • 4Celfond M.Answer sets[M] //In Handbook of Knowledge Representation,[s.l.] :Elsevier,2007:285-316.
  • 5Dantsin E,Eiter T,Gottlob G.et al.Complexity and expres-sive power of logic programming[J].ACM Computing Sur-veys,2001,33(3):374-425.
  • 6Neumann A,Schaub T,Gebser B,et al.Gonflict-driven an-swer set solving[C] //In Proceedings of the 20th International Joint Conference on Artificial Intelligence(IJCAI2007).Men-lo Park:AAAI Press.2007:386-392.
  • 7Simons P,Niemela I,Soininen T.Extending and implement-ing the stable model semantics[J].Artif.Intell.,2002,138(1-2):181-234.
  • 8Syrjanen T.Lparse 1.0 user's manual[M].[s.l.] :GPL,2000.
  • 9Gotlieb C.The eonstruction of class-teacher timetable[c] //Information processing,Proc.IFIP Congress.Vancouver,British Columbia,Canada:[s.n.].1962:73-77.
  • 10陈章辉,黄小晖,任文艺,康烈.基于双倍体遗传算法求解大学排课问题[J].计算机应用,2008,28(12):3074-3076. 被引量:5

二级参考文献7

共引文献12

同被引文献40

  • 1田国会.家庭服务机器人研究前景广阔[J].国际学术动态,2007(1):28-29. 被引量:21
  • 2Gelfond M, Lifschitz V. The stable model mantics for logic programming[ C ]//Proceedings of the 5th International Con- ference on Igic Programming ( ICLP-88 ). Seattle, Washing- ton : M1T Press, 1988 : 1070-1080.
  • 3Simons P, Niemela I, Soininen T. Extending and implementing the:stabie model semantics[ J ]]. Artif. Intell. ,2002,138 (1- 2) :181-234.
  • 4Gellond M. Answer sets[ M] //Handbook of Knowledge Rep- resentation. [ s. 1. ] :Elsevier,2007:285-316.
  • 5Gebser M, Kaminski B, Kaufmann B, et al. Engineering an In- cremental ASP Solver[M]. [s. l. ] :Is. n. ] ,2008.
  • 6Gebser M, Kaminski R, Kaufmann B, et al. A User's guide to gringo,clasp,clingo and iclingo[ M]. [ s. 1.] : [ s. n. ] ,2008.
  • 7田国会,李晓磊,赵守鹏,路飞.家庭服务机器人智能空间技术研究与进展[J].山东大学学报(工学版),2007,37(5):53-59. 被引量:37
  • 8Chevaleyre Y,Endriss U,Jerome L.Nicolas Maudet:A ShortIntroduction to Computational Social Choice[C]//Proc.of the33rd Conference on Current Trends in Theory and Practice ofComputer Science.[S.l.]:Springer-Verlag,2007.
  • 9Woeginger G J.Banks Winners in Tournaments are Difficult toRecognize[J].Social Choice and Welfare,2003,20(3):523-528.
  • 10Lifschitz V.Answer Set Programming and Plan Generation[J].Artificial Intelligence,2002,138(1-2):39-54.

引证文献5

二级引证文献9

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部