Conjunctive Queries with Negation over DL-Lite: A Closer Look

  • Víctor Gutiérrez-Basulto
  • Yazmín Ibañez-García
  • Roman Kontchakov
  • Egor V. Kostylev
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7994)


While conjunctive query (CQ) answering over DL-Lite has been studied extensively, there have been few attempts to analyse CQs with negated atoms. This paper deepens the study of the problem. Answering CQs with safe negation and CQs with a single inequality over DL-Lite with role inclusions is shown to be undecidable, even for a fixed TBox and query.Without role inclusions, answering CQs with one inequality is P-hard and with two inequalities coNP-hard in data complexity.


Turing Machine Description Logic Conjunctive Query Domain Element Existential Closure 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    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. Autom. Reasoning 39(3), 385–429 (2007)CrossRefzbMATHGoogle Scholar
  2. 2.
    Artale, A., Calvanese, D., Kontchakov, R., Zakharyaschev, M.: The DL-Lite family and relations. J. Artif. Intell. Res. (JAIR) 36, 1–69 (2009)Google Scholar
  3. 3.
    Rosati, R.: The limits of querying ontologies. In: Schwentick, T., Suciu, D. (eds.) ICDT 2007. LNCS, vol. 4353, pp. 164–178. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  4. 4.
    Bienvenu, M., Ortiz, M., Simkus, M.: Answering expressive path queries over lightweight DL knowledge bases. In: Proc. of the 2012 Int. Workshop on Description Logics (DL). CEUR-WS, vol. 846 (2012)Google Scholar
  5. 5.
    Gutiérrez-Basulto, V., Ibáñez-García, Y.A., Kontchakov, R.: An update on query answering with restricted forms of negation. In: Krötzsch, M., Straccia, U. (eds.) RR 2012. LNCS, vol. 7497, pp. 75–89. Springer, Heidelberg (2012)CrossRefGoogle Scholar
  6. 6.
    Kostylev, E.V., Reutter, J.L.: Answering counting aggregate queries over ontologies of the DL-Lite family. In: Proc. of the 27th AAAI Conf. on Artificial Intelligence (AAAI) (2013)Google Scholar
  7. 7.
    Deutsch, A., Nash, A., Remmel, J.B.: The chase revisited. In: Proc. of the 27th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (PODS), pp. 149–158. ACM Press (2008)Google Scholar
  8. 8.
    Kontchakov, R., Lutz, C., Toman, D., Wolter, F., Zakharyaschev, M.: The combined approach to query answering in DL-Lite. In: Proc. of the 12th Int. Conf. on Principles of Knowledge Representation and Reasoning (KR). AAAI Press (2010)Google Scholar
  9. 9.
    Klenke, T.: Über die Entscheidbarkeit von konjunktiv Anfragen mit Ungleichheit in der Beschreibungslogik \(\mathcal{EL}\). Master’s thesis, Universität Bremen (2010)Google Scholar
  10. 10.
    Vardi, M.Y.: The complexity of relational query languages (extended abstract). In: Proc. of the 14th Annual ACM Symposium on Theory of Computing (STOC), pp. 137–146. ACM (1982)Google Scholar
  11. 11.
    Papadimitriou, C.H.: Computational complexity. Academic Internet Publ. (2007)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Víctor Gutiérrez-Basulto
    • 1
  • Yazmín Ibañez-García
    • 2
  • Roman Kontchakov
    • 3
  • Egor V. Kostylev
    • 4
  1. 1.Fachbereich Mathematik und InformatikUniversität BremenGermany
  2. 2.KRDB Research CentreFree University of Bozen-BolzanoItaly
  3. 3.Dept. of Computer Science and Inf. SystemsBirkbeck, University of LondonUK
  4. 4.School of InformaticsUniversity of EdinburghUK

Personalised recommendations