Computing Information Minimal Match Explanations for Logic-Based Matchmaking

In semantic matchmaking processes it is often useful, when the obtained match is not full, to provide explanations for the mismatch, to leverage further interaction and/or modifying the request. To this aim, Abduction in Description Logics has been studied, though ---till now--- on rather inexpressive languages. In this paper we present a new method for computing Abduction over complex concept descriptions in the expressive Description Logic \SH. Our proposal divides the abduced concept in pieces, which allow for direct and concise explanations. The approach exploits information within a prefixed tableau to compute solutions that take into account the structure of a formula. Hypotheses are pieces of a formula to be added inside the quantifiers of a complex concept description and not just added as outermost conjunctions. we propose suitable definitions of the problem, algorithms and calculus. we also give some hints on how to fruitfully use the proposed technique to provide rankings in the matchmaking process.

[1]  R. Möller,et al.  Multimedia Interpretation as Abduction , 2007 .

[2]  Peter A. Flach,et al.  Abduction and Induction , 2000 .

[3]  Diego Calvanese,et al.  The Description Logic Handbook , 2007 .

[4]  Nadia Creignou,et al.  A Complete Classification of the Complexity of Propositional Abduction , 2006, SIAM J. Comput..

[5]  Francesco M. Donini,et al.  Abductive Matchmaking using Description Logics , 2003, IJCAI.

[6]  Freddy Lécué,et al.  Applying Abduction in Semantic Web Service Composition , 2007, IEEE International Conference on Web Services (ICWS 2007).

[7]  Paliath Narendran,et al.  Unification of Concept Terms in Description Logics , 2001, Description Logics.

[8]  Francesco M. Donini,et al.  A Uniform Tableaux-Based Method for Concept Abduction and Contraction in Description Logics , 2004, ECAI.

[9]  Pierre Marquis,et al.  Extending abduction from propositional to first-order logic , 1991, FAIR.

[10]  Paolo Mancarella,et al.  Abductive Logic Programming , 1992, LPNMR.

[11]  Bernhard Nebel,et al.  An Empirical Analysis of Optimization Techniques for Terminological Representation Systems, or Making KRIS Get a Move On , 1992, KR.

[12]  Thomas Lukasiewicz,et al.  Variable-Strength Conditional Preferences for Matchmaking in Description Logics , 2006, KR.

[13]  Umberto Straccia,et al.  Vague Knowledge Bases for Matchmaking in P2P E-Marketplaces , 2007, ESWC.

[14]  Matthias Klusch,et al.  Automated semantic web service discovery with OWLS-MX , 2006, AAMAS '06.

[15]  Takahiro Kawamura,et al.  Semantic Matching of Web Services Capabilities , 2002, SEMWEB.

[16]  Ian Horrocks,et al.  A Software Framework for Matchmaking Based on Semantic Web Technology , 2004, Int. J. Electron. Commer..

[17]  Ulrike Sattler,et al.  A Case for Abductive Reasoning over Ontologies , 2006, OWLED.

[18]  Yann Chevaleyre,et al.  Expressive Power of Weighted Propositional Formulas for Cardinal Preference Modeling , 2006, KR.

[19]  Deborah L. McGuinness,et al.  Matching in Description Logics , 1999, J. Log. Comput..

[20]  Ian Horrocks,et al.  Using an Expressive Description Logic: FaCT or Fiction? , 1998, KR.

[21]  Francesco M. Donini,et al.  Concept abduction and contraction for semantic-based discovery of matches and negotiation spaces in an e-marketplace , 2004, ICEC '04.

[22]  Francesco M. Donini,et al.  A system for principled matchmaking in an electronic marketplace , 2003, WWW '03.

[23]  R. Smullyan.  First-Order Logic , 1968 .

[24]  Francesco M. Donini,et al.  Semantic Matchmaking as Non-Monotonic Reasoning: A Description Logic Approach , 2007, J. Artif. Intell. Res..