Finding ALL Answers to OBDA Queries Using Referring Expressions | SpringerLink
Skip to main content
Springer Nature Link
Log in

Finding ALL Answers to OBDA Queries Using Referring Expressions

  • Conference paper
  • First Online:
AI 2019: Advances in Artificial Intelligence (AI 2019)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 11919))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
JPY 3498
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
JPY 5719
Price includes VAT (Japan)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
JPY 7149
Price includes VAT (Japan)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

Notes

  1. 1.

    We appeal to intuition in this example; full definitions follow in Sect. 2.

  2. 2.

    Note that even in the standard setting, two syntactically distinct constants may co-refer to the same object unless UNA is assumed.

  3. 3.

    In the standard construction, the Hintikka sets are generated syntactically by analyzing concepts present in a TBox. Here, to simplify the presentation, we rely on logical implication algorithms already developed for the underlying logics.

  4. 4.

    This construction is essentially the same as the construction of the so called canonical model for \(\mathcal{EL}^{\bot }\) [1, 8].

  5. 5.

    We relax this condition in the subsequent section.

  6. 6.

    Note that if there are no foldings of Q the set of answers set is empty.

References

  1. Baader, F., Brandt, S., Lutz, C.: Pushing the \(\cal{EL}\) envelope. In: Proceedings of the IJCAI, pp. 364–369 (2005)

    Google Scholar 

  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)

    MATH  Google Scholar 

  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. Detwiler, L., Mejino, J., Brinkley, J.: From frames to OWL2: converting the foundational model of anatomy. Artif. Intell. Med. 69, 12–21 (2016)

    Article  Google Scholar 

  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)

    Article  Google Scholar 

  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. 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_20

    Chapter  Google Scholar 

  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. 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_38

    Chapter  Google Scholar 

  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_38

    Chapter  Google Scholar 

  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 

Download references

Author information

Authors and Affiliations

  1. Cheriton School of Computer Science, University of Waterloo, Waterloo, Canada

    David Toman & Grant Weddell

Authors
  1. David Toman
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Grant Weddell
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to David Toman .

Editor information

Editors and Affiliations

  1. University of South Australia, Adelaide, SA, Australia

    Jixue Liu

  2. The University of Melbourne, Melbourne, VIC, Australia

    James Bailey

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Toman, D., Weddell, G. (2019). Finding ALL Answers to OBDA Queries Using Referring Expressions. In: Liu, J., Bailey, J. (eds) AI 2019: Advances in Artificial Intelligence. AI 2019. Lecture Notes in Computer Science(), vol 11919. Springer, Cham. https://doi.org/10.1007/978-3-030-35288-2_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-35288-2_10

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-35287-5

  • Online ISBN: 978-3-030-35288-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation