Advertisement

Finding ALL Answers to OBDA Queries Using Referring Expressions

  • David TomanEmail author
  • Grant Weddell
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11919)

Abstract

We explore how referring expressions can be used to enhance how a conjunctive query is answered over description logic knowledge bases in a way that allows one to return not only answers explicitly named by constant symbols, but also anonymous individuals that are entailed to satisfy the query, and to provide syntactic means for referring to such individuals. In particular, for the logics \(\text {Horn-}\mathcal{ALC}\) and \(\mathcal{EL}^{\bot }\), we focus on reporting all entailed answers, on techniques necessary to finitely describe such sets of answers, and on extensions to more complex logics and settings.

References

  1. 1.
    Baader, F., Brandt, S., Lutz, C.: Pushing the \(\cal{EL}\) envelope. In: Proceedings of the IJCAI, pp. 364–369 (2005)Google Scholar
  2. 2.
    Baader, F., Calvanese, D., McGuinness, D.L., Nardi, D., Patel-Schneider, P.F.: The Description Logic Handbook: Theory, Implementation, and Applications. Cambridge University Press, Cambridge (2003)zbMATHGoogle Scholar
  3. 3.
    Borgida, A., Toman, D., Weddell, G.: On referring expressions in query answering over first order knowledge bases. In: Proceedings of the KR, pp. 319–328 (2016)Google Scholar
  4. 4.
    Detwiler, L., Mejino, J., Brinkley, J.: From frames to OWL2: converting the foundational model of anatomy. Artif. Intell. Med. 69, 12–21 (2016)CrossRefGoogle Scholar
  5. 5.
    Hartel, F., de Coronado, S., Dionne, R., Fragoso, G., Golbeck, J.: Modeling a description logic vocabulary for cancer research. J. Biomed Inf. 38(2), 114–29 (2005)CrossRefGoogle Scholar
  6. 6.
    Hustadt, U., Motik, B., Sattler, U.: Data complexity of reasoning in very expressive description logics. In: Proceedings of the IJCAI, pp. 466–471 (2005)Google Scholar
  7. 7.
    Lutz, C., Seylan, İ., Toman, D., Wolter, F.: The combined approach to OBDA: taming role hierarchies using filters. In: Alani, H., et al. (eds.) ISWC 2013. LNCS, vol. 8218, pp. 314–330. Springer, Heidelberg (2013).  https://doi.org/10.1007/978-3-642-41335-3_20CrossRefGoogle Scholar
  8. 8.
    Lutz, C., Toman, D., Wolter, F.: Conjunctive query answering in the description logic EL using a relational database system. In: Proceedings of the IJCAI, pp. 2070–2075 (2009)Google Scholar
  9. 9.
    Suntisrivaraporn, B., Baader, F., Schulz, S., Spackman, K.: Replacing SEP-triplets in SNOMED CT using tractable description logic operators. In: Bellazzi, R., Abu-Hanna, A., Hunter, J. (eds.) AIME 2007. LNCS (LNAI), vol. 4594, pp. 287–291. Springer, Heidelberg (2007).  https://doi.org/10.1007/978-3-540-73599-1_38CrossRefGoogle Scholar
  10. 10.
    Toman, D., Weddell, G.: Identity resolution in ontology based data access to structured data sources. In: Nayak, A.C., Sharma, A. (eds.) PRICAI 2019. LNCS (LNAI), vol. 11670, pp. 473–485. Springer, Cham (2019).  https://doi.org/10.1007/978-3-030-29908-8_38CrossRefGoogle Scholar
  11. 11.
    Vardi, M.Y.: Why is modal logic so robustly decidable? In: Descriptive Complexity and Finite Models. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 31, pp. 149–183. DIMACS/AMS (1996)Google Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  1. 1.Cheriton School of Computer ScienceUniversity of WaterlooWaterlooCanada

Personalised recommendations