Computer Science – Artificial Intelligence
Scientific paper
2011-10-12
Journal Of Artificial Intelligence Research, Volume 29, pages 269-307, 2007
Computer Science
Artificial Intelligence
Scientific paper
10.1613/jair.2153
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.
Donini F. M.
Noia T. Di
Sciascio E. Di
No associations
LandOfFree
Semantic Matchmaking as Non-Monotonic Reasoning: A Description Logic Approach does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Semantic Matchmaking as Non-Monotonic Reasoning: A Description Logic Approach, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Semantic Matchmaking as Non-Monotonic Reasoning: A Description Logic Approach will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-634609