检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]吉林大学计算机科学与技术学院,长春130012
出 处:《吉林大学学报(理学版)》2007年第5期800-804,共5页Journal of Jilin University:Science Edition
基 金:吉林省科技发展计划项目基金(批准号:20050527)
摘 要:用描述逻辑中的两种非标准推理概念收缩和概念诱导,分别扩展了可满足性问题和包含问题,以解决供应与需求的匹配问题,并提出了改进的排序算法以及有助于完善供需双方资源和需求描述的算法.结果表明,改进后的排序算法有利于供需双方的交互,并且能够尽快排除因为严格特性而部分匹配的供应和需求,从而加快算法的运行速度.Two non-standard inferences in description logic --concept contraction and concept abduction, which respectively extend satisfiability and subsumption, were used to solve matching problem between supplies and demands. The improved rank algorithm and the algorithm which helps to perfect the resource and requirement descriptions of suppliers and demanders were proposed. The improved rank algorithm favors the interaction of suppliers and demanders, excludes the partially matched supplies and demands for strict constraints as soon as possible, consequently quickens the execution speed of the algorithm.
分 类 号:TP311[自动化与计算机技术—计算机软件与理论]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.15