计算机应用 ›› 2005, Vol. 25 ›› Issue (08): 1870-1873.DOI: 10.3724/SP.J.1087.2005.01870

• 软件开发与方法 • 上一篇    下一篇

奥运赛程编排约束的语义表示法

蒲川江1,黄必清2,李春平1   

  1. 1.清华大学软件学院; 2/清华大学自动化系
  • 发布日期:2011-04-07 出版日期:2005-08-01
  • 基金资助:

    北京市自然科学重点基金资助项目(4031002)

Semantic representation method of tournament scheduling constraints in Olympics

PU Chuan-jiang1,HUANG Bi-qing2,LI Chun-ping1   

  1. 1.School of Software,Tsinghua University,Beijing 100084,China; 2.CIMS Center,Department of Automation,Tsinghua University,Beijing 100084,China
  • Online:2011-04-07 Published:2005-08-01

摘要: 奥运赛程编排结果应符合奥运竞赛规程惯例,各单项比赛的编排规则,以及各种编排要求,最大限度满足各种编排约束条件。奥运赛程编排约束具有数量多、种类多、可动态改变的特点。结合关系数据库,利用约束模板和约束项提出的约束语义表示法具有灵活、易于扩充的优点,在实现编排约束的表示、解析、交互、存储功能的同时,解决了编排约束的人机交互和动态变化问题。

关键词: 语义, 约束, 约束项, 约束模板, 约束解析

Abstract: Scheduling results for sport tournament in Olympics should satisfy the tournament routine, programming rules and demands of each sport. It should satisfy all constraints to the max. The tournament scheduling constraints in Olympics had characters of large numbers of quantity and category, dynamic alterability. The semantic representation method, established by constraint templates and constraint items based on the relation database, had flexible and extensible advantages. It realized the functions of representing, parsing, interacting and storing scheduling constraints, also resolved man-machine interactive and dynamic alterable problems.

Key words: semantic, constraint, constraint item, constraint template, constraint parsing

中图分类号: