期刊名称：Journal of Automation, Mobile Robotics & Intelligent Systems (JAMRIS)
印刷版ISSN：1897-8649
电子版ISSN：2080-2145
出版年度：2007
卷号：29
页码：269-307
出版社：Industrial Research Inst. for Automation and Measurements, Warsaw
摘要：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
