Temporal Conjunctive Queries in Expressive Description Logics with Transitive Roles

  • Franz Baader
  • Stefan BorgwardtEmail author
  • Marcel Lippmann
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9457)


In Ontology-Based Data Access (OBDA), user queries are evaluated over a set of facts under the open world assumption, while taking into account background knowledge given in the form of a Description Logic (DL) ontology. In order to deal with dynamically changing data sources, temporal conjunctive queries (TCQs) have recently been proposed as a useful extension of OBDA to support the processing of temporal information. We extend the existing complexity analysis of TCQ entailment to very expressive DLs underlying the OWL 2 standard, and in contrast to previous work also allow for queries containing transitive roles.


Description Logic Conjunctive Query Satisfiability Problem Temporal Query Combine Complexity 
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.


  1. 1.
    Artale, A., Kontchakov, R., Wolter, F., Zakharyaschev, M.: Temporal description logic for ontology-based data access. In: Proceedings of IJCAI 2013, pp. 711–717 (2013)Google Scholar
  2. 2.
    Baader, F.: Ontology-based monitoring of dynamic systems. In: Proceedings of KR 2014, pp. 678–681 (2014)Google Scholar
  3. 3.
    Baader, F., Borgwardt, S., Lippmann, M.: Temporal conjunctive queries in expressive DLs with non-simple roles. LTCS-Report 15–17, Chair of Automata Theory, TU Dresden (2015).
  4. 4.
    Baader, F., Borgwardt, S., Lippmann, M.: Temporal query entailment in the description logic \({\cal {SHQ}}\). J. Web Semant. 33, 71–93 (2015)CrossRefGoogle Scholar
  5. 5.
    Baader, F., Calvanese, D., McGuinness, D.L., Nardi, D., Patel-Schneider, P.F. (eds.): The Description Logic Handbook: Theory, Implementation, and Applications, 2nd edn. Cambridge University Press, Cambridge (2007)zbMATHGoogle Scholar
  6. 6.
    Baader, F., Ghilardi, S., Lutz, C.: LTL over description logic axioms. ACM T. Comput. Log. 13(3), 21:1–21:32 (2012)MathSciNetzbMATHGoogle Scholar
  7. 7.
    Bienvenu, M., Ortiz, M., Šimkus, M., Xiao, G.: Tractable queries for lightweight description logics. In: Rossi, F. (ed.) Proceedings of IJCAI 2013, pp. 768–774 (2013)Google Scholar
  8. 8.
    Bienvenu, M., ten Cate, B., Lutz, C., Wolter, F.: Ontology-based data access: a study through disjunction datalog, CSP, and MMSNP. ACM T. Database Syst. 39(4), 33:1–33:44 (2014)Google Scholar
  9. 9.
    Bonatti, P.A., Lutz, C., Murano, A., Vardi, M.Y.: The complexity of enriched \(\mu \)-calculi. Log. Meth. Comput. Sci. 4(3:11), 1–27 (2008)Google Scholar
  10. 10.
    Borgwardt, S., Thost, V.: Temporal query answering in DL-Lite with negation. In: Proceedings of GCAI 2015 (2015, to appear)Google Scholar
  11. 11.
    Borgwardt, S., Thost, V.: Temporal query answering in the description logic \(\cal EL\). In: Proceedings of IJCAI 2015, pp. 2819–2825 (2015)Google Scholar
  12. 12.
    Calvanese, D., Eiter, T., Ortiz, M.: Regular path queries in expressive description logics with nominals. In: Proceedings of IJCAI 2009, pp. 714–720 (2009)Google Scholar
  13. 13.
    Calvanese, D., Eiter, T., Ortiz, M.: Answering regular path queries in expressive description logics via alternating tree-automata. Inf. Comput. 237, 12–55 (2014)MathSciNetCrossRefzbMATHGoogle Scholar
  14. 14.
    Decker, S., Erdmann, M., Fensel, D., Studer, R.: Ontobroker: ontology based access to distributed and semi-structured information. In: Meersman, R., Tari, Z., Stevens, S. (eds.) Database Semantics. IFIP, vol. 11, pp. 351–369. Springer, New York (1999)CrossRefGoogle Scholar
  15. 15.
    Eiter, T., Lutz, C., Ortiz, M., Šimkus, M.: Query answering in description logics with transitive roles. In: Proceedings of IJCAI 2009, pp. 759–764 (2009)Google Scholar
  16. 16.
    Glimm, B., Horrocks, I., Lutz, C., Sattler, U.: Conjunctive query answering for the description logic \({\cal {SHIQ}}\). J. Artif. Intell. Res. 31(1), 157–204 (2008)MathSciNetzbMATHGoogle Scholar
  17. 17.
    Glimm, B., Horrocks, I., Sattler, U.: Unions of conjunctive queries in \({\cal {SHOQ}}\). In: Proceedings of KR 2008, pp. 252–262 (2008)Google Scholar
  18. 18.
    Glimm, B., Kazakov, Y., Lutz, C.: Status \(\cal QIO\): an update. In: Proceedings of DL 2011, pp. 136–146 (2011)Google Scholar
  19. 19.
    Horrocks, I., Sattler, U., Tobies, S.: Practical reasoning for very expressive description logics. L. J. IGPL 8(3), 239–263 (2000)MathSciNetCrossRefzbMATHGoogle Scholar
  20. 20.
    Lippmann, M.: Temporalised description logics for monitoring partially observable events. Ph.D. thesis, TU Dresden, Germany (2014)Google Scholar
  21. 21.
    Lutz, C.: The complexity of conjunctive query answering in expressive description logics. In: Armando, A., Baumgartner, P., Dowek, G. (eds.) Automated Reasoning. LNCS, vol. 5195, pp. 179–193. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  22. 22.
    Lutz, C., Wolter, F.: Non-uniform data complexity of query answering in description logics. In: Brewka, G., Eiter, T., McIlraith, S.A. (eds.) Proceedings of KR 2012, pp. 297–307 (2012)Google Scholar
  23. 23.
    Ngo, N., Ortiz, M., Šimkus, M.: The combined complexity of reasoning with closed predicates in description logics. In: Proceedings of DL 2015, pp. 249–261 (2015)Google Scholar
  24. 24.
    Ortiz, M., Calvanese, D., Eiter, T.: Data complexity of query answering in expressive description logics via tableaux. J. Autom. Reasoning 41(1), 61–98 (2008)MathSciNetCrossRefzbMATHGoogle Scholar
  25. 25.
    Ortiz, M., Šimkus, M.: Reasoning and query answering in description logics. In: Reasoning Web. 8th International Summer School, Chap. 1, pp. 1–53 (2012)Google Scholar
  26. 26.
    Pnueli, A.: The temporal logic of programs. In: Proceedings of SFCS 1977, pp. 46–57 (1977)Google Scholar
  27. 27.
    Poggi, A., Calvanese, D., De Giacomo, G., Lembo, D., Lenzerini, M., Rosati, R.: Linking data to ontologies. J. Data Semant. 10, 133–173 (2008)zbMATHGoogle Scholar
  28. 28.
    Rudolph, S., Glimm, B.: Nominals, inverses, counting, and conjunctive queries or: why infinity is your friend!. J. Artif. Intell. Res. 39(1), 429–481 (2010)MathSciNetzbMATHGoogle Scholar
  29. 29.
    Schaerf, A.: On the complexity of the instance checking problem in concept languages with existential quantification. J. Intell. Inf. Syst. 2(3), 265–278 (1993)CrossRefGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  • Franz Baader
    • 1
  • Stefan Borgwardt
    • 1
    Email author
  • Marcel Lippmann
    • 1
  1. 1.Theoretical Computer ScienceTU DresdenDresdenGermany

Personalised recommendations