论文部分内容阅读
描述逻辑是知识表示和推理的形式化工具。ALC(D)使用具体域(concrete domain)的概念扩展描述逻辑(ALC),可以在更具体的层面上为已有知识建模。本文利用ALC(D)有效的推理功能,提出一种基于罚分(penalty)的Web服务匹配算法,按照罚分的多少来决定匹配的优先级,增强了Web服务匹配的精确性。最后构造了算法实现的体系结构并给出了一个实例。
Description logic is the formalized tool of knowledge representation and reasoning. ALC (D) extends the description logic (ALC) using the concept of concrete domains to model existing knowledge at a more specific level. In this paper, we use ALC (D) efficient inference function to propose a Web service matching algorithm based on penalty. According to the penalty, the priority of matching is determined and the accuracy of Web service matching is enhanced. Finally, the architecture of the algorithm is constructed and an example is given.