## 1 Computing Information Minimal Match Explanations for Logic-based Matchmaking

### BibTeX

@MISC{Noia_1computing,

author = {Tommaso Di Noia and Eugenio Di Sciascio and Francesco M. Donini},

title = {1 Computing Information Minimal Match Explanations for Logic-based Matchmaking},

year = {}

}

### OpenURL

### Abstract

Abstract—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. I.

### Citations

536 | Abductive logic programming
- Kakas, Kowalski, et al.
- 1992
(Show Context)
Citation Context ...n of Propositional Abduction has been extensively studied, for nearly all criteria that can be adopted for choosing the preferred hypotheses [14]. Also Abductive Logic Programming is well established =-=[15]-=-, and its computation resorts on a modification of SLD-resolution. Yet, when the representation language chosen for the application domain is a Description Logic (DL), the picture is far from being co... |

278 |
First-Order Logic
- Smullyan
(Show Context)
Citation Context ... compute a solution to a structural abduction problems as defined in Section II-A for the expressive Description Logic SH [18]. In the following we assume the reader be familiar with tableau calculus =-=[22]-=-. Following [16], we will build a prefixed tableau using two labeling functions (to represent true/false prefixed tableaux) T() and F() instead of a single labeling one L() [18]. T() and F() map an in... |

275 | Basic description logics
- Baader, Nu�
- 2003
(Show Context)
Citation Context ...for computing Concept Abduction in the DL ALN was devised [16]. However, although ALN is computationally simple, it is a rather inexpressive DL. Our proposal extends the framework of Concept Matching =-=[17]-=-. In a nutshell, we identify places in the description of C where a hypothesis can be added, and name such places with (all distinct) concept variables H0, H1, H2, . . . We denote C h the resulting co... |

251 | Using an expressive description logic: FaCT or fiction
- Horrocks
- 1998
(Show Context)
Citation Context .... 1. Since we use two labeling functions, for each classical tableau rule we have we both a T) version and its dual F) version. The only optimization technique we include here is lazy unfolding [23], =-=[24]-=-. We assume concepts are always simplified in NNF and we use C to represent the NNF of a concept C. Given a SH concept in NNF, whenever we have a role Q ∈ F(n, m), it is of the form ¬R. Hence Q ∈ F(n,... |

140 | An empirical analysis of optimization techniques for terminological representation systems or: Making KRIS get a move on
- Baader, Franconi, et al.
- 1994
(Show Context)
Citation Context ...in Fig. 1. Since we use two labeling functions, for each classical tableau rule we have we both a T) version and its dual F) version. The only optimization technique we include here is lazy unfolding =-=[23]-=-, [24]. We assume concepts are always simplified in NNF and we use C to represent the NNF of a concept C. Given a SH concept in NNF, whenever we have a role Q ∈ F(n, m), it is of the form ¬R. Hence Q ... |

76 |
Automated semantic web service discovery with OWLS-MX
- Klusch, Fries, et al.
- 2006
(Show Context)
Citation Context ...h. In order to provide an ordering with respect to a request several approaches have been proposed in recent years, including e.g., approaches based on mixed semantic/information retrieval techniques =-=[4]-=-, fuzzy Description Logics [5], conditional preferences [6]. A further possibility is to exploit abductive reasoning [7]. The usefulness and possibilities of abductive reasoning in the wide arena of S... |

70 | A System for Principled Matchmaking in an Electronic Marketplace,” paper presented at the WWW2003 Conference
- Noia, Sciascio, et al.
- 2003
(Show Context)
Citation Context ...roblem, algorithms and calculus. we also give some hints on how to fruitfully use the proposed technique to provide rankings in the matchmaking process. I. INTRODUCTION Semantic Matchmaking [1], [2], =-=[3]-=- is basically the problem of finding, given a request, best available offers, under the assumption that both the request and offers are modeled in accordance with a common ontology. To evaluate how go... |

50 |
Concept abduction and contraction for semantic-based discovery of matches and negotiation spaces in an e-marketplace
- Colucci, Noia, et al.
- 2004
(Show Context)
Citation Context ...for matchmaking in e-commerce with reference to ALN Description Logic (DL). This nonmonotonic service has proved useful in different scenarios where a ranking and logic-based explanation where needed =-=[12]-=-, [13], yet its definition showed its limits for expressive logics endowed with existential quantification. Here we overcome such limits by introducing Structural Abduction in the expressive SH DL and... |

47 | Unification of concepts terms in description logics
- Baader, Narendran
(Show Context)
Citation Context ... inside connectives and quantifiers, recursively, till negation is in front of concept names only. In the following, we augment concept expressions by means of concept variables. We call concept term =-=[19]-=- every concept expression formed by using the syntax above, plus the ability of using a concept variable h ∈ {h0, h1, h2, . . .}, in place of a concept name. To extend the semantics of SH to concept t... |

37 | F.M.: Semantic matchmaking as non-monotonic reasoning: A description logic approach
- Noia, Sciascio, et al.
(Show Context)
Citation Context ...ve been clearly illustrated by Elsenbroich, Kutz and Sattler [8], nevertheless approaches based on abductive reasoning have been so far confined to ABox abduction [9], [8] and Concept Abduction [10], =-=[11]-=-, devised by some of the authors of this paper for matchmaking in e-commerce with reference to ALN Description Logic (DL). This nonmonotonic service has proved useful in different scenarios where a ra... |

29 | A case for abductive reasoning over ontologies
- Elsenbroich, Kutz, et al.
- 2006
(Show Context)
Citation Context ...ibility is to exploit abductive reasoning [7]. The usefulness and possibilities of abductive reasoning in the wide arena of Semantic web have been clearly illustrated by Elsenbroich, Kutz and Sattler =-=[8]-=-, nevertheless approaches based on abductive reasoning have been so far confined to ABox abduction [9], [8] and Concept Abduction [10], [11], devised by some of the authors of this paper for matchmaki... |

26 | Expressive power of weighted propositional formulas for cardinal preference modeling
- Chevaleyre, Endriss, et al.
- 2007
(Show Context)
Citation Context ...its worth (absolute or relative to the other preferences). Hence, for a user request we distinguish between a concept DS representing strict requirements and a set of weighted formulas P = {〈Di, vi〉} =-=[25]-=- where Di is a DL concept and vi is a numerical value representing preference worth. It should be clear that a matchmaking process has not to be performed w.r.t. DS. It represents what the user is not... |

20 |
A Software Framework for Matchmaking based on
- Li, Horrock
- 2003
(Show Context)
Citation Context ...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. I. INTRODUCTION Semantic Matchmaking [1], =-=[2]-=-, [3] is basically the problem of finding, given a request, best available offers, under the assumption that both the request and offers are modeled in accordance with a common ontology. To evaluate h... |

16 | A complete classification of the complexity of propositional abduction
- Creignou, Zanuttini
- 2006
(Show Context)
Citation Context ...ic matchmaking process using expressive DLs. The computation of Propositional Abduction has been extensively studied, for nearly all criteria that can be adopted for choosing the preferred hypotheses =-=[14]-=-. Also Abductive Logic Programming is well established [15], and its computation resorts on a modification of SLD-resolution. Yet, when the representation language chosen for the application domain is... |

15 |
Extending abduction from propositional to first-order logic
- Marquis
(Show Context)
Citation Context ...obtain this result would need a global counter, visible by all recursive calls. We skip this technical detail to simplify presentation. atoms are (implicitly) taken conjunctively. As noted by Marquis =-=[21]-=- for First-order Abduction, if disjunction and full negation are allowed in solutions of an Abduction problem, the most general hypothesis is always ¬C ⊔ D, which in fact solves nothing. In what follo... |

12 |
Applying abduction in semantic web service composition
- Lécué, Delteil, et al.
- 2007
(Show Context)
Citation Context ...tchmaking in e-commerce with reference to ALN Description Logic (DL). This nonmonotonic service has proved useful in different scenarios where a ranking and logic-based explanation where needed [12], =-=[13]-=-, yet its definition showed its limits for expressive logics endowed with existential quantification. Here we overcome such limits by introducing Structural Abduction in the expressive SH DL and prese... |

10 | Variable-strength conditional preferences for matchmaking in description logics
- Lukasiewicz, Schellhase
- 2006
(Show Context)
Citation Context ...t several approaches have been proposed in recent years, including e.g., approaches based on mixed semantic/information retrieval techniques [4], fuzzy Description Logics [5], conditional preferences =-=[6]-=-. A further possibility is to exploit abductive reasoning [7]. The usefulness and possibilities of abductive reasoning in the wide arena of Semantic web have been clearly illustrated by Elsenbroich, K... |

9 |
A Uniform Tableaux-Based Method for Concept Abduction and Contraction
- Colucci, Noia, et al.
- 2004
(Show Context)
Citation Context ... C ⊓ H—is satisfiable in T , and (ii) in all models of T , C ⊓ H is subsumed by D (denoted by T |= C ⊓ H ⊑ D). Also a tableaux-based calculus for computing Concept Abduction in the DL ALN was devised =-=[16]-=-. However, although ALN is computationally simple, it is a rather inexpressive DL. Our proposal extends the framework of Concept Matching [17]. In a nutshell, we identify places in the description of ... |

5 |
Modal propositional abduction
- Mayer, Pirri
(Show Context)
Citation Context ...t of D. That is, Def. 1 cannot be used to prefer an offer that already partly covers the demand (W1) over another (W2) that does not. We remark that also Cialdea&Pirri’s Propositional Modal Abduction =-=[20]-=- would compute ⋄(CC ∧ https) (with ⋄ the3 modality associated with howPay) for both abduction problems. Hence, also their proposal cannot be used to highlight the missing information inside quantific... |

3 |
Abduction and induction
- unknown authors
- 1955
(Show Context)
Citation Context ...uding e.g., approaches based on mixed semantic/information retrieval techniques [4], fuzzy Description Logics [5], conditional preferences [6]. A further possibility is to exploit abductive reasoning =-=[7]-=-. The usefulness and possibilities of abductive reasoning in the wide arena of Semantic web have been clearly illustrated by Elsenbroich, Kutz and Sattler [8], nevertheless approaches based on abducti... |

2 |
Vague knowledge-bases for matchmaking in p2p e-marketplaces
- Ragone, Straccia, et al.
(Show Context)
Citation Context ...ring with respect to a request several approaches have been proposed in recent years, including e.g., approaches based on mixed semantic/information retrieval techniques [4], fuzzy Description Logics =-=[5]-=-, conditional preferences [6]. A further possibility is to exploit abductive reasoning [7]. The usefulness and possibilities of abductive reasoning in the wide arena of Semantic web have been clearly ... |

2 |
Abductive matchmaking in description logics
- Noia, Sciascio, et al.
- 2003
(Show Context)
Citation Context ...web have been clearly illustrated by Elsenbroich, Kutz and Sattler [8], nevertheless approaches based on abductive reasoning have been so far confined to ABox abduction [9], [8] and Concept Abduction =-=[10]-=-, [11], devised by some of the authors of this paper for matchmaking in e-commerce with reference to ALN Description Logic (DL). This nonmonotonic service has proved useful in different scenarios wher... |