Concept Abduction in Description Logics with Cardinality Restrictions

Recently the usefulness of Concept Abduction, a novel non-monotonic inference service for Description Logics (DLs), has been argued in the context of ontology-based applications such as semantic matchmaking and resource retrieval. Based on tableau calculus, a method has been proposed to realize this reasoning task in ALN, a description logic that supports simple cardinality restrictions as well as other basic constructors. However, in many ontology-based systems, the representation of ontology would require expressive formalisms for capturing domain-specific constraints, this language is not sufficient. In order to increase the applicability of the abductive reasoning method in such contexts, we would like to present in the scope of this paper an extension of the tableaux-based algorithm for dealing with concepts represented inALCQ, the description logic that extends ALN with full concept negation and quantified number restrictions.





References:
[1] Franz Baader, Diego Calvanese, Deborah L. McGuinness, Daniele Nardi,
and Peter F. Patel-Schneider, editors. The Description Logic Handbook:Theory, Implementation, and Applications. Cambridge University Press,2003.
[2] Franz Baader and Ulrike Sattler. An overview of tableau algorithms for
description logics. Studia Logica, 69:2001, 2000.
[3] Jie Bao, George Voutsadakis, Giora Slutzki, and Vasant Honavar.
Package-based description logics.
[4] S. Colucci, T. Di Noia, E. Di Sciascio, F. M. Donini, and M. Mongiello.
A uniform tableaux-based approach to concept abduction and contraction
in aln. In Contraction in ALN . In Proc. of DL-04 (2004), CEUR
Workshop Proceedings, page 104, 2004.
[5] Simona Colucci, Tommaso Di Noia, Eugenio Di Sciascio, Francesco M.
Donini, Agnese Pinto, and Azzurra Ragone. Semantic-based resource
retrieval using non-standard inference services in description logics.
[6] Simona Colucci, Tommaso Di Noia, Eugenio Di Sciascio, Marina
Mongiello, and Francesco M. Donini. Concept abduction and contraction
for semantic-based discovery of matches and negotiation spaces in an
e-marketplace. In ICEC -04: Proceedings of the 6th international
conference on Electronic commerce, pages 41-50, New York, NY, USA,
2004. ACM.
[7] Corinna Elsenbroich, Oliver Kutz, and Ulrike Sattler. A case for
abductive reasoning over ontologies. In in ÔÇÿProc. OWL: Experiences
and Directions, pages 10-11, 2006.
[8] Lei Li and Ian Horrocks. A software framework for matchmaking based
on semantic web technology. pages 331-339. ACM Press, 2003.
[9] Industry Minister of the Economy and Employment. Nouvelle grille de
classification h├┤telière, 2009.
[10] Tommaso Di Noia, Eugenio Di Sciascio, and Francesco M. Donini.
Semantic matchmaking as non-monotonic reasoning: A description logic
approach. Journal of Artificial Intelligence Research, 29:307, 2007.
[11] Tommaso Di Noia, Eugenio Di Sciascio, Francesco M. Donini, and
Marina Mongiello. Abductive matchmaking using description logics.
In In Proc. of IJCAI 2003, pages 337-342. Morgan Kaufmann, 2003.
[12] Charles Sanders Peirce. Abduction and induction. In Justus Buchler,
editor, Philosophical writings of Pierce, pages 150-156. New York:
Dover Books, 1955.
[13] Katia Sycara, Widoff S, Klusch M, and Jianguo Lu. Larks: Dynamic
matchmaking among heterogeneous software agents in cyberspace. In in
Cyberspace. Autonomous Agents and Multi-Agent Systems, pages 173-
203, 2002.