首页 | 本学科首页   官方微博 | 高级检索  
     

奥运赛程编排约束的语义表示法
引用本文:蒲川江,黄必清,李春平.奥运赛程编排约束的语义表示法[J].计算机应用,2005,25(8):1870-1873.
作者姓名:蒲川江  黄必清  李春平
作者单位:清华大学,软件学院,北京,100084;清华大学,自动化系,北京,100084
基金项目:北京市自然科学重点基金资助项目(4031002)
摘    要:奥运赛程编排结果应符合奥运竞赛规程惯例,各单项比赛的编排规则,以及各种编排要求,最大限度满足各种编排约束条件。奥运赛程编排约束具有数量多、种类多、可动态改变的特点。结合关系数据库,利用约束模板和约束项提出的约束语义表示法具有灵活、易于扩充的优点,在实现编排约束的表示、解析、交互、存储功能的同时,解决了编排约束的人机交互和动态变化问题。

关 键 词:语义  约束  约束项  约束模板  约束解析
文章编号:1001-9081(2005)08-1870-04

Semantic representation method of tournament scheduling constraints in Olympics
PU Chuan-jiang,HUANG Bi-qing,LI Chun-ping.Semantic representation method of tournament scheduling constraints in Olympics[J].journal of Computer Applications,2005,25(8):1870-1873.
Authors:PU Chuan-jiang  HUANG Bi-qing  LI Chun-ping
Affiliation:1.School of Software,Tsinghua University,Beijing 100084,China; 2.CIMS Center,Department of Automation,Tsinghua University,Beijing 100084,China
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.
Keywords:semantic  constraint  constraint item  constraint template  constraint parsing
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《计算机应用》浏览原始摘要信息
点击此处可从《计算机应用》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号