Advertisement

Explanation in the DL-Lite Family of Description Logics

  • Alexander Borgida
  • Diego Calvanese
  • Mariano Rodriguez-Muro
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5332)

Abstract

In ontology-based data access (OBDA), access to (multiple) incomplete data sources is mediated by a conceptual layer constituted by an ontology. In such a setting, to correctly compute answers to queries, it is necessary to perform complex reasoning over the constraints expressed by the ontology. We consider the case of ontologies expressed in DL − Lite, a family of DLs that, in the context of OBDA, provide an optimal tradeoff between expressive power and computational complexity of reasoning; notably conjunctive query answering is LOGSPACE in the size of the data. However, query answering with reasoning comes at a price: the justification of the presence of tuples in answers is no longer trivial, and requires explanation. In this paper, we characterize reasoning in DL − Lite, through deduction rules for building proofs, and we provide several novel contributions: (i) For standard ontology level reasoning, explanation is relatively simple, and our contribution comes mainly from a novel focus on brevity of proofs. (ii) Motivated by the use of DL − Lite for OBDA, we analyze and provide explanation for reasoning in finite models. (iii) We provide a facility for the explanation of an answer to a conjunctive query over a DL − Lite ontology. This algorithm is able to exploit the relational query engine to extract from the data the information necessary for finding the explanation more efficiently, and thus scales to large data sets. The presented approach has been implemented in a prototype for constructing explanations.

Keywords

Inference Rule Description Logic Conjunctive Query Original Query Proof Tree 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Borgida, A., Calvanese, D., Rodriguez-Muro, M.: Explanation in DL-Lite. In: Proc. of the 2008 Description Logic Workshop (DL 2008). CEUR Electronic Workshop Proceedings (2008), http://ceur-ws.org/
  2. 2.
    Elmasri, R., Wiederhold, G.: GORDAS: A formal high-level query language for the entity-relationship model. In: Proc. of the 2nd Int.Conf.on the Entity-Relationship Approach (ER 1981), pp. 49–72 (1981)Google Scholar
  3. 3.
    Baader, F., Calvanese, D., McGuinness, D., Nardi, D., Patel-Schneider, P.F. (eds.): The Description Logic Handbook: Theory, Implementation and Applications. Cambridge University Press, Cambridge (2003)zbMATHGoogle Scholar
  4. 4.
    Calvanese, D., Lenzerini, M., Nardi, D.: Unifying class-based representation formalisms. J. of Artificial Intelligence Research 11, 199–240 (1999)MathSciNetzbMATHGoogle Scholar
  5. 5.
    Berardi, D., Calvanese, D., De Giacomo, G.: Reasoning on UML class diagrams. Artificial Intelligence 168(1–2), 70–118 (2005)MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    Calvanese, D., De Giacomo, G., Lembo, D., Lenzerini, M., Rosati, R.: Tractable reasoning and efficient query answering in description logics: The DL-Lite family. J. of Automated Reasoning 39(3), 385–429 (2007)MathSciNetCrossRefzbMATHGoogle Scholar
  7. 7.
    Calvanese, D., De Giacomo, G., Lembo, D., Lenzerini, M., Rosati, R.: Tailoring OWL for data intensive ontologies. In: Proc. of the Workshop on OWL: Experiences and Directions (OWLED 2005). CEUR Electronic Workshop Proceedings, vol. 188 (2005), http://ceur-ws.org/Vol-188/
  8. 8.
    Shmueli, O., Tsur, S.: Logical diagnosis of LDL programs. In: Proc. of the 7th Int. Conf. on Logic Programming (ICLP 1990), pp. 112–129 (1990)Google Scholar
  9. 9.
    Arora, T., Ramakrishnan, R., Roth, W.G., Seshadri, P., Srivastava, D.: Explaining program execution in deductive systems. In: Ceri, S., Tsur, S., Tanaka, K. (eds.) DOOD 1993. LNCS, vol. 760, pp. 101–119. Springer, Heidelberg (1993)CrossRefGoogle Scholar
  10. 10.
    McGuinness, D.L., Borgida, A.: Explaining subsumption in description logics. In: Proc. of the 14th Int. Joint Conf. on Artificial Intelligence (IJCAI 1995), pp. 816–821 (1995)Google Scholar
  11. 11.
    Deng, X., Haarslev, V., Shiri, N.: A framework for explaining reasoning in description logics. In: Working Notes of the AAAI Fall Symposium on Explanation-aware Computing, pp. 189–204 (2005)Google Scholar
  12. 12.
    Schlobach, S.: Explaining subsumption by optimal interpolation. In: Alferes, J.J., Leite, J.A. (eds.) JELIA 2004. LNCS (LNAI), vol. 3229, pp. 413–425. Springer, Heidelberg (2004)Google Scholar
  13. 13.
    Schlobach, S.: Debugging and semantic clarification by pinpointing. In: Gómez-Pérez, A., Euzenat, J. (eds.) ESWC 2005. LNCS, vol. 3532, pp. 226–240. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  14. 14.
    Schlobach, S., Cornet, R.: Explanation of terminological reasoning: A preliminary report. In: Proc.of the 2003 Description Logic Workshop (DL 2003) (2003)Google Scholar
  15. 15.
    Godfrey, P., Minker, J., Novik, L.: An architecture for a cooperative database system. In: Risch, T., Litwin, W. (eds.) ADB 1994. LNCS, vol. 819, pp. 3–24. Springer, Heidelberg (1994)CrossRefGoogle Scholar
  16. 16.
    Godfrey, P.: Minimization in cooperative response to failing database queries. Int. J. of Cooperative Information Systems 6, 95–149 (1997)CrossRefGoogle Scholar
  17. 17.
    McGuinness, D.L., Pinheiro da Silva, P.: Explaining answers from the Semantic Web: the Inference Web approach. J. of Web Semantics 1(4), 397–413 (2004)CrossRefGoogle Scholar
  18. 18.
    Calvanese, D., De Giacomo, G., Lembo, D., Lenzerini, M., Rosati, R.: Data complexity of query answering in description logics. In: Proc.of the 10th Int.Conf.on the Principles of Knowledge Representation and Reasoning (KR 2006), pp. 260–270 (2006)Google Scholar
  19. 19.
    Poggi, A., Lembo, D., Calvanese, D., De Giacomo, G., Lenzerini, M., Rosati, R.: Linking data to ontologies. J. on Data Semantics X, 133–173 (2008)zbMATHGoogle Scholar
  20. 20.
    Pinheiro da Silva, P., McGuinness, D.L., Fikes, R.: A proof markup language for semantic web services. Information Systems 31(4–5), 381–395 (2006)CrossRefGoogle Scholar
  21. 21.
    Borgida, A.: From type systems to knowledge representation: Natural semantics specifications for description logics. J. of Intelligent and Cooperative Information Systems 1(1), 93–126 (1992)CrossRefGoogle Scholar
  22. 22.
    Borgida, A., Franconi, E., Horrocks, I., McGuinness, D.L., Patel-Schneider, P.F.: Explaining \(\mathcal{ALC}\) subsumption. In: Proc.of the 1999 Description Logic Workshop (DL 1999). CEUR Electronic Workshop Proceedings, vol. 22 (1999), http://ceur-ws.org/Vol-22/
  23. 23.
    Fiedler, A.: Natural Language Proof Explanation. In: Hutter, D., Stephan, W. (eds.) Mechanizing Mathematical Reasoning. LNCS, vol. 2605, pp. 342–363. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  24. 24.
    Rosati, R.: Finite model reasoning in DL-Lite. In: Bechhofer, S., Hauswirth, M., Hoffmann, J., Koubarakis, M. (eds.) ESWC 2008. LNCS, vol. 5021. Springer, Heidelberg (2008)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Alexander Borgida
    • 1
  • Diego Calvanese
    • 2
  • Mariano Rodriguez-Muro
    • 2
  1. 1.Dept. of Computer ScienceRutgers UniversityUSA
  2. 2.Faculty of Computer ScienceFree University of Bozen-BolzanoItaly

Personalised recommendations