Partial Matchmaking for complex Product and Service Descriptions

10 years 7 months ago
Partial Matchmaking for complex Product and Service Descriptions
: Matchmaking between offers and requests is an essential mechanism in electronic market places. Description Logics have been proposed as a appropriate framework for representing offers and requests and standard methods from description logics reasoning have been proposed for computing matches. We argue that classical reasoning is not well suited for realistic scenarios as it does not allow to compute partial matches and qualify the mismatch. We propose a more flexible approach for matching complex product and service descriptions based on the notion of approximate subsumption in expressive description logics and present a prototypical implementation of our matching system. 1 Motivation As more and more business is performed online, the importance of electronic marketplaces where products and services are traded in a semi-automatic way is increasing steadily. One of the basic problems connected to an efficient use of electronic marketplaces is the problem of matchmaking between offers ...
Heiner Stuckenschmidt, Martin Kolb
Added 29 Oct 2010
Updated 29 Oct 2010
Type Conference
Year 2008
Where MKWI
Authors Heiner Stuckenschmidt, Martin Kolb
Comments (0)