Skip to main content
SpringerLink
Log in

Finding New Diamonds: Temporal Minimal-World Query Answering over Sparse ABoxes

  • Conference paper
  • First Online:
Book cover Rules and Reasoning (RuleML+RR 2019)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 11784))

Included in the following conference series:

Abstract

Lightweight temporal ontology languages have become a very active field of research in recent years. Many real-world applications, like processing electronic health records (EHRs), inherently contain a temporal dimension, and require efficient reasoning algorithms. Moreover, since medical data is not recorded on a regular basis, reasoners must deal with sparse data with potentially large temporal gaps. In this paper, we introduce a temporal extension of the tractable language , which features a new class of convex diamond operators that can be used to bridge temporal gaps. We develop a completion algorithm for our logic, which shows that entailment remains tractable. Based on this, we develop a minimal-world semantics for answering metric temporal conjunctive queries with negation. We show that query answering is combined first-order rewritable, and hence in polynomial time in data complexity.

This work was partially supported by DFG grant 389792660 as part of TRR 248 and the DFG project BA 1122/19-1 (GOASQ).

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • 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

Notes

  1. 1.

    https://clinicaltrials.gov/ct2/show/NCT02280564.

  2. 2.

    https://clinicaltrials.gov/ct2/show/NCT02873052.

  3. 3.

    https://clinicaltrials.gov/ct2/show/NCT02157311.

  4. 4.

    https://clinicaltrials.gov/ct2/show/NCT00969735.

  5. 5.

    https://www.snomed.org/.

  6. 6.

    https://clinicaltrials.gov/ct2/show/NCT01198002.

  7. 7.

    Strictly speaking, \(\psi _\mathcal {T}\) in [12] is a set of first-order formulas, which is however equivalent to the disjunction of all these formulas.

References

  1. Alur, R., Henzinger, T.A.: A really temporal logic. J. ACM 41(1), 181–204 (1994)

    Article  MathSciNet  Google Scholar 

  2. Artale, A., Kontchakov, R., Kovtunova, A., Ryzhikov, V., Wolter, F., Zakharyaschev, M.: First-order rewritability of ontology-mediated temporal queries. In: Proceedings IJCAI, pp. 2706–2712. AAAI Press (2015)

    Google Scholar 

  3. Artale, A., Kontchakov, R., Kovtunova, A., Ryzhikov, V., Wolter, F., Zakharyaschev, M.: Ontology-mediated query answering over temporal data: a survey (invited talk). In: Proceedings TIME, pp. 1:1–1:37. Schloss Dagstuhl (2017)

    Google Scholar 

  4. Artale, A., Kontchakov, R., Lutz, C., Wolter, F., Zakharyaschev, M.: Temporalising tractable description logics. In: Proceedings TIME, pp. 11–22. IEEE Press (2007)

    Google Scholar 

  5. Artale, A., Kontchakov, R., Wolter, F., Zakharyaschev, M.: Temporal description logic for ontology-based data access. In: Proceedings IJCAI, pp. 711–717. AAAI Press (2013)

    Google Scholar 

  6. Baader, F., Borgwardt, S., Forkel, W.: Patient selection for clinical trials using temporalized ontology-mediated query answering. In: Proceedings HQA, pp. 1069–1074. ACM (2018)

    Google Scholar 

  7. Baader, F., Borgwardt, S., Koopmann, P., Ozaki, A., Thost, V.: Metric temporal description logics with interval-rigid names. In: Dixon, C., Finger, M. (eds.) FroCoS 2017. LNCS (LNAI), vol. 10483, pp. 60–76. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-66167-4_4

    Chapter  Google Scholar 

  8. Baader, F., Borgwardt, S., Lippmann, M.: Temporal query entailment in the description logic \(\cal{SHQ}\). J. Web Sem. 33, 71–93 (2015)

    Article  Google Scholar 

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

    Google Scholar 

  10. Basin, D., Klaedtke, F., Müller, S., Zălinescu, E.: Monitoring metric first-order temporal properties. J. ACM 62(2), 1–45 (2015)

    Article  MathSciNet  Google Scholar 

  11. Bonomi, L., Jiang, X.: Patient ranking with temporally annotated data. J. Biomed. Inf. 78, 43–53 (2018)

    Article  Google Scholar 

  12. Borgwardt, S., Forkel, W.: Closed-world semantics for conjunctive queries with negation over \(\cal{ELH}_\bot \) ontologies. In: Calimeri, F., Leone, N., Manna, M. (eds.) JELIA 2019. LNCS (LNAI), vol. 11468, pp. 371–386. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-19570-0_24

    Chapter  Google Scholar 

  13. Borgwardt, S., Lippmann, M., Thost, V.: Temporalizing rewritable query languages over knowledge bases. J. Web Sem. 33, 50–70 (2015)

    Article  Google Scholar 

  14. Brandt, S., Kalaycı, E.G., Ryzhikov, V., Xiao, G., Zakharyaschev, M.: Querying log data with metric temporal logic. J. Artif. Intell. Res. 62, 829–877 (2018)

    Article  MathSciNet  Google Scholar 

  15. Calvanese, D., De Giacomo, G., Lembo, D., Lenzerini, M., Rosati, R.: Data complexity of query answering in description logics. Art. Intell. 195, 335–360 (2013)

    Article  MathSciNet  Google Scholar 

  16. Crowe, C.L., Tao, C.: Designing ontology-based patterns for the representation of the time-relevant eligibility criteria of clinical protocols. AMIA Jt. Summits Transl. Sci. Proc. 2015, 173–177 (2015)

    Google Scholar 

  17. Deutsch, A., Nash, A., Remmel, J.B.: The chase revisited. In: Proceedings of the Twenty-Seventh ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS 2008, 9–11 June 2008, Vancouver, BC, Canada, pp. 149–158 (2008)

    Google Scholar 

  18. Furia, C.A., Spoletini, P.: Tomorrow and all our yesterdays: MTL satisfiability over the integers. In: Fitzgerald, J.S., Haxthausen, A.E., Yenigun, H. (eds.) ICTAC 2008. LNCS, vol. 5160, pp. 126–140. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-85762-4_9

    Chapter  Google Scholar 

  19. Gutiérrez-Basulto, V., Ibáñez-García, Y., Kontchakov, R., Kostylev, E.V.: Queries with negation and inequalities over lightweight ontologies. J. Web Sem. 35, 184–202 (2015)

    Article  Google Scholar 

  20. Gutiérrez-Basulto, V., Jung, J.C., Kontchakov, R.: Temporalized \(\cal{EL}\) ontologies for accessing temporal data: complexity of atomic queries. In: Proceedings IJCAI, pp. 1102–1108. AAAI Press (2016)

    Google Scholar 

  21. Gutiérrez-Basulto, V., Jung, J.C., Ozaki, A.: On metric temporal description logics. In: Proceedings ECAI, pp. 837–845. IOS Press (2016)

    Google Scholar 

  22. Hripcsak, G., Zhou, L., Parsons, S., Das, A.K., Johnson, S.B.: Modeling electronic discharge summaries as a simple temporal constraint satisfaction problem. J. Am. Med. Inform. Assn. 12(1), 55–63 (2005)

    Article  Google Scholar 

  23. Jones, N.D., Laaser, W.T.: Complete problems for deterministic polynomial time. Theore. Comput. Sci. 3(1), 105–117 (1976)

    Article  MathSciNet  Google Scholar 

  24. Krisnadhi, A., Lutz, C.: Data complexity in the \(\cal{EL}\) family of description logics. In: Dershowitz, N., Voronkov, A. (eds.) LPAR 2007. LNCS (LNAI), vol. 4790, pp. 333–347. Springer, Heidelberg (2007). https://doi.org/10.1007/978-3-540-75560-9_25

    Chapter  Google Scholar 

  25. Krötzsch, M., Rudolph, S.: Conjunctive queries for \(\cal{EL}\) with role composition. In: Proceedings DL, pp. 355–362 (2007)

    Google Scholar 

  26. Lindell, S.: A purely logical characterization of circuit uniformity. In: Proceedings of the 7th Annual Structure in Complexity Theory Conference, pp. 185–192 (1992)

    Google Scholar 

  27. Lutz, C., Toman, D., Wolter, F.: Conjunctive query answering in the description logic \(\cal{EL}\) using a relational database system. In: Proceedings IJCAI, pp. 2070–2075. AAAI Press (2009)

    Google Scholar 

  28. Lutz, C., Wolter, F., Zakharyaschev, M.: Temporal description logics: a survey. In: Proceedings of the 15th International Symposium on Temporal Representation and Reasoning (TIME 2008), pp. 3–14. IEEE Press (2008)

    Google Scholar 

  29. Rosati, R.: On conjunctive query answering in \(\cal{EL}\). In: Proceedings DL, pp. 451–458 (2007)

    Google Scholar 

  30. Thost, V.: Metric temporal extensions of DL-Lite and interval-rigid names. In: Proceedings KR, pp. 665–666. AAAI Press (2018)

    Google Scholar 

  31. Vardi, M.Y.: The complexity of relational query languages (extended abstract). In: Proceedings STOC, pp. 137–146. ACM (1982)

    Google Scholar 

  32. Wolter, F., Zakharyaschev, M.: Temporalizing description logics. In: Frontiers of Combining Systems 2, pp. 379–402. Research Studies Press/Wiley (2000)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Chair for Automata Theory, Technische Universität Dresden, Dresden, Germany

    Stefan Borgwardt, Walter Forkel & Alisa Kovtunova

Authors
  1. Stefan Borgwardt
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Walter Forkel
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Alisa Kovtunova
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Alisa Kovtunova .

Editor information

Editors and Affiliations

  1. Stony Brook University, Stony Brook, NY, USA

    Paul Fodor

  2. Free University of Bozen-Bolzano, Bolzano, Italy

    Marco Montali

  3. Free University of Bozen-Bolzano, Bolzano, Italy

    Diego Calvanese

  4. SINTEF AS, Oslo, Norway

    Dumitru Roman

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

Borgwardt, S., Forkel, W., Kovtunova, A. (2019). Finding New Diamonds: Temporal Minimal-World Query Answering over Sparse ABoxes. In: Fodor, P., Montali, M., Calvanese, D., Roman, D. (eds) Rules and Reasoning. RuleML+RR 2019. Lecture Notes in Computer Science(), vol 11784. Springer, Cham. https://doi.org/10.1007/978-3-030-31095-0_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-31095-0_1

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-31094-3

  • Online ISBN: 978-3-030-31095-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation