Semantic matchmaking as non-monotonic reasoning: A description logic approach
Semantic matchmaking as non-monotonic reasoning: A description logic approach
复制标题
DOI：
10.1613/jair.2153
复制
发表时间：
2007-01-01
影响因子：
5
通讯作者：
Donini, Francesco M.
中科院分区：
文献类型：
--
作者：
Di Noia, Tommaso;Di Sciascio, Eugenio;Donini, Francesco M.
当供求在电子市场上相遇时，或者当代理人搜索网络服务以执行某些任务时，甚至当招聘机构匹配课程和工作简介时，就会出现配对。在这样的开放环境中，匹配过程的目标是发现针对给定请求的最佳可用报价。我们从知识表示的角度来解决匹配问题，基于描述逻辑的形式化。我们设计了概念溯因和概念收缩作为描述逻辑中的非单调推理，适用于在逻辑框架中建模匹配，并证明了一些相关的复杂性结果。我们还提出了合理的算法的基础上设计的推理，语义匹配，并证明他们服从一些常识性质。最后，我们报告建议的匹配框架，这已被用来作为调解人在电子市场和语义Web服务发现的实施。
Matchmaking arises when supply and demand meet in an electronic marketplace, or when agents search for a web service to perform some task, or even when recruiting agencies match curricula and job profiles. In such open environments, the objective of a matchmaking process is to discover best available offers to a given request. We address the problem of matchmaking from a knowledge representation perspective, with a formalization based on Description Logics. We devise Concept Abduction and Concept Contraction as non-monotonic inferences in Description Logics suitable for modeling matchmaking in a logical framework, and prove some related complexity results. We also present reasonable algorithms for semantic matchmaking based on the devised inferences, and prove that they obey to some commonsense properties. Finally, we report on the implementation of the proposed matchmaking framework, which has been used both as a mediator in e-marketplaces and for semantic web services discovery.