Unification of concept terms in description logics
Journal of Symbolic Computation
Extending abduction from propositional to first-order logic
FAIR '91 Proceedings of the International Workshop on Fundamentals of Artificial Intelligence Research
Semantic Matching of Web Services Capabilities
ISWC '02 Proceedings of the First International Semantic Web Conference on The Semantic Web
A system for principled matchmaking in an electronic marketplace
WWW '03 Proceedings of the 12th international conference on World Wide Web
A software framework for matchmaking based on semantic web technology
WWW '03 Proceedings of the 12th international conference on World Wide Web
A Complete Classification of the Complexity of Propositional Abduction
SIAM Journal on Computing
Automated semantic web service discovery with OWLS-MX
AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
The Description Logic Handbook
The Description Logic Handbook
Semantic matchmaking as non-monotonic reasoning: a description logic approach
Journal of Artificial Intelligence Research
Abductive matchmaking using description logics
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Electronic Commerce Research and Applications
ABox abduction in ALC using a DL tableau
Proceedings of the South African Institute for Computer Scientists and Information Technologists Conference
Semantic matchmaking and ranking: beyond deduction in retrieval scenarios
RR'12 Proceedings of the 6th international conference on Web Reasoning and Rule Systems
| Hi-index | 0.00 |
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.