article

Tractable Reasoning and Efficient Query Answering in Description Logics: The DL-Lite Family

Authors:

Diego Calvanese,

Giuseppe Giacomo,

Domenico Lembo,

Maurizio Lenzerini,

Riccardo RosatiAuthors Info & Claims

Journal of Automated Reasoning, Volume 39, Issue 3

Pages 385 - 429

https://doi.org/10.1007/s10817-007-9078-x

Published: 01 October 2007 Publication History

Abstract

We propose a new family of description logics (DLs), called DL-Lite , specifically tailored to capture basic ontology languages, while keeping low complexity of reasoning. Reasoning here means not only computing subsumption between concepts and checking satisfiability of the whole knowledge base, but also answering complex queries (in particular, unions of conjunctive queries) over the instance level (ABox) of the DL knowledge base. We show that, for the DLs of the DL-Lite family, the usual DL reasoning tasks are polynomial in the size of the TBox, and query answering is L og S pace in the size of the ABox (i.e., in data complexity). To the best of our knowledge, this is the first result of polynomial-time data complexity for query answering over DL knowledge bases. Notably our logics allow for a separation between TBox and ABox reasoning during query evaluation: the part of the process requiring TBox reasoning is independent of the ABox, and the part of the process requiring access to the ABox can be carried out by an SQL engine, thus taking advantage of the query optimization strategies provided by current database management systems. Since even slight extensions to the logics of the DL-Lite family make query answering at least NL og S pace in data complexity, thus ruling out the possibility of using on-the-shelf relational technology for query processing, we can conclude that the logics of the DL-Lite family are the maximal DLs supporting efficient query answering over large amounts of instances.

References

[1]

1. Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison-Wesley, Reading, MA (1995).

[2]

2. Acciarri, A., Calvanese, D., De Giacomo, G., Lembo, D., Lenzerini, M., Palmieri, M., Rosati, R.: QUONTO: QUerying ONTOlogies. In: Proc. of the 20th National Conference on Artificial Intelligence (AAAI 2005), pp. 1670-1671 (2005).

[3]

3. Arenas, M., Bertossi, L.E., Chomicki, J.: Consistent query answers in inconsistent databases. In: Proc. of the 18th ACM SIGACT SIGMOD SIGART Symp. on Principles of Database Systems (PODS'99), pp. 68-79 (1999).

Digital Library

[4]

4. Baader, F., Brandt, S., Lutz, C.: Pushing the ¿ L envelope. In: Proc. of the 19th Int. Joint Conf. on Artificial Intelligence (IJCAI 2005) pp. 364-369 (2005).

[5]

5. Baader, F., Calvanese, D., McGuinness, D., Nardi, D., Patel-Schneider, P.F., (Eds.): The description logic handbook: Theory, implementation and applications. Cambridge University Press, Cambridge, MA (2003).

[6]

6. Borgida, A., Brachman, R.J.: Conceptual modeling with description logics. In: {5}, chapter 10, pp. 349-372 (2003).

[7]

7. Borgida, A., Brachman, R.J., McGuinness, D.L., Resnick, L.A.: CLASSIC: a structural data model for objects. In: Proc. of the ACM SIGMOD Int. Conf. on Management of Data, pp. 59-67 (1989).

Digital Library

[8]

8. Bravo, L., Bertossi, L.: Logic programming for consistently querying data integration systems. In: Proc. of the 18th Int. Joint Conf. on Artificial Intelligence (IJCAI 2003), pp. 10-15 (2003).

Digital Library

[9]

9. Calì, A., Lembo, D., Rosati, R.: On the decidability and complexity of query answering over inconsistent and incomplete databases. In: Proc. of the 22nd ACM SIGACT SIGMOD SIGART Symp. on Principles of Database Systems (PODS 2003), pp. 260-271 (2003a).

[10]

10. Calì, A., Lembo, D., Rosati, R.: Query rewriting and answering under constraints in data integration systems. In: Proc. of the 18th Int. Joint Conf. on Artificial Intelligence (IJCAI 2003), pp. 16-21 (2003b).

Digital Library

[11]

11. Calvanese, D.: Reasoning with inclusion axioms in description logics: algorithms and complexity. In: Proc. of the 12th Eur. Conf. on Artificial Intelligence (ECAI'96), pp. 303-307 (1996).

[12]

12. Calvanese, D., De Giacomo, G., Lembo, D., Lenzerini, M., Poggi, A., Rosati, R.: Linking data to ontologies: the description logic DL-Lite _A. In: Proc. of the 2nd Workshop on OWL: experiences and directions (OWLED 2006) (2006a).

[13]

13. Calvanese, D., De Giacomo, G., Lembo, D., Lenzerini, M., Rosati, R.: DL-Lite: tractable description logics for ontologies. In: Proc. of the 20th National Conference on Artificial Intelligence (AAAI 2005), pp. 602-607 (2005).

[14]

14. Calvanese, D., De Giacomo, G., Lembo, D., Lenzerini, M., Rosati, R.: Data complexity of query answering in description logics. In: Proc. of the 10th Int. Conf. on the Principles of Knowledge Representation and Reasoning (KR 2006), pp. 260-270 (2006b).

[15]

15. Calvanese, D., De Giacomo, G., Lembo, D., Lenzerini, M., Rosati, R.: Can OWL model football leagues?. In: Proc. of the 3rd Workshop on OWL: Experiences and Directions (OWLED 2007) (2007).

[16]

16. Calvanese, D., De Giacomo, G., Lenzerini, M.: Answering queries using views over description logics knowledge bases. In: Proc. of the 17th Nat. Conf. on Artificial Intelligence (AAAI 2000), pp. 386-391 (2000).

Digital Library

[17]

17. Chen, P.P.: The entity-relationship model: toward a unified view of data. ACM Trans. Database Syst. 1 (1), 9-36 (1976).

Digital Library

[18]

18. De Giacomo, G., Lenzerini, M., Poggi, A., Rosati, R.: On the update of description logic ontologies at the instance level. In: Proc. of the 21st National Conference on Artificial Intelligence (AAAI 2006) (2006).

Digital Library

[19]

19. Donini, F.M., Lenzerini, M., Nardi, D., Schaerf, A.: Deduction in concept languages: from subsumption to instance checking. J. Log. Comput. 4 (4), 423-452 (1994).

[20]

20. Donini, F.M., Lenzerini, M., Nardi, D., Schaerf, A.: AL -log: integrating datalog and description logics. J. Intell. Inf. Syst. 10 (3), 227-252 (1998).

[21]

21. Duschka, O.M., Genesereth, M.R., Levy, A.Y.: Recursive query plans for data integration. J. Log. Program. 43 (1), 49-73 (2000).

[22]

22. Fan, W., Siméon, J.: Integrity constraints for XML. In: Proc. of the 19th ACM SIGACT SIGMOD SIGART Symp. on Principles of Database Systems (PODS 2000), pp. 23-34 (2000).

[23]

23. Grosof, B.N., Horrocks, I., Volz, R., Decker, S.: Description logic programs: combining logic programs with description logic. In: Proc. of the 12th Int. World Wide Web Conf. (WWW 2003), pp. 48-57 (2003).

[24]

24. Hustadt, U., Motik, B., Sattler, U.: Data complexity of reasoning in very expressive description logics. In: Proc. of the 19th Int. Joint Conf. on Artificial Intelligence (IJCAI 2005), pp. 466-471 (2005).

Digital Library

[25]

25. Johnson, D.S., Klug, A.C.: Testing containment of conjunctive queries under functional and inclusion dependencies. J. Comput. Syst. Sci. 28 (1), 167-189 (1984).

[26]

26. Levy, A.Y., Rousset, M.-C.: Combining horn rules and description logics in CARIN. Artif. Intell. 104 (1,2), 165-209 (1998).

Digital Library

[27]

27. Ortiz, M.M., Calvanese, D., Eiter, T.: Characterizing data complexity for conjunctive query answering in expressive description logics. In: Proc. of the 21st Nat. Conf. on Artificial Intelligence (AAAI 2006) (2006).

Digital Library

[28]

28. Poggi, A., Lembo, D., Calvanese, D., De Giacomo, G., Lenzerini, M., Rosati, R.: Linking data to ontologies. Submitted for publication (2007).

[29]

29. Rosati, R.: On the decidability and finite controllability of query processing in databases with incomplete information. In: Proc. of the 25th ACM SIGACT SIGMOD SIGART Symp. on Principles of Database Systems (PODS 2006), pp. 356-365 (2006).

[30]

30. Vardi, M.Y.: The complexity of relational query languages. In: Proc. of the 14th ACM SIGACT Symp. on Theory of Computing (STOC'82), pp. 137-146 (1982).

Cited By

Jabbour SMa YRaddaoui BDastani MSichman JAlechina NDignum V(2024)Towards a Principle-based Framework for Repair Selection in Inconsistent Knowledge BasesProceedings of the 23rd International Conference on Autonomous Agents and Multiagent Systems10.5555/3635637.3662945(907-915)Online publication date: 6-May-2024
https://dl.acm.org/doi/10.5555/3635637.3662945
Masmoudi MBen Abdallah Ben Lamine SKarray MArchimede BBaazaoui Zghal H(2024)Semantic Data Integration and Querying: A Survey and ChallengesACM Computing Surveys10.1145/365331756:8(1-35)Online publication date: 26-Apr-2024
https://dl.acm.org/doi/10.1145/3653317
Lukumbuzya SOrtiz MŠimkus M(2024)Datalog rewritability and data complexity of ALCHOIQ with closed predicatesArtificial Intelligence10.1016/j.artint.2024.104099330:COnline publication date: 1-May-2024
https://dl.acm.org/doi/10.1016/j.artint.2024.104099
Show More Cited By

Index Terms

Tractable Reasoning and Efficient Query Answering in Description Logics: The DL-Lite Family

Recommendations

Paraconsistent query answering over DL-Lite ontologies

Consistent query answering over description logic based ontologies is an important topic in ontology engineering as it can provide meaningful answers to queries posed over inconsistent ontologies. Current approaches for dealing with this problem usually ...
Tractable Reasoning with Bayesian Description Logics
SUM '08: Proceedings of the 2nd international conference on Scalable Uncertainty Management

The <em>DL-Lite</em>family of tractable description logics lies between the semantic web languages RDFS and OWL Lite. In this paper, we present a probabilistic generalization of the <em>DL-Lite</em>description logics, which is based on Bayesian ...
View-based query answering in Description Logics: Semantics and complexity

View-based query answering is the problem of answering a query based only on the precomputed answers to a set of views. While this problem has been widely investigated in databases, it is largely unexplored in the context of Description Logic ...

Comments

Information & Contributors

Information

Published In

cover image Journal of Automated Reasoning

Journal of Automated Reasoning Volume 39, Issue 3

October 2007

183 pages

ISSN:0168-7433

Issue’s Table of Contents

Copyright © Copyright © 2007 Springer Science+Business Media B.V.

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 01 October 2007

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

483
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 27 Jul 2024

Other Metrics

View Author Metrics

Citations

Cited By

Jabbour SMa YRaddaoui BDastani MSichman JAlechina NDignum V(2024)Towards a Principle-based Framework for Repair Selection in Inconsistent Knowledge BasesProceedings of the 23rd International Conference on Autonomous Agents and Multiagent Systems10.5555/3635637.3662945(907-915)Online publication date: 6-May-2024
https://dl.acm.org/doi/10.5555/3635637.3662945
Masmoudi MBen Abdallah Ben Lamine SKarray MArchimede BBaazaoui Zghal H(2024)Semantic Data Integration and Querying: A Survey and ChallengesACM Computing Surveys10.1145/365331756:8(1-35)Online publication date: 26-Apr-2024
https://dl.acm.org/doi/10.1145/3653317
Lukumbuzya SOrtiz MŠimkus M(2024)Datalog rewritability and data complexity of ALCHOIQ with closed predicatesArtificial Intelligence10.1016/j.artint.2024.104099330:COnline publication date: 1-May-2024
https://dl.acm.org/doi/10.1016/j.artint.2024.104099
Cima GLembo DMarconi LRosati RSavo D(2024)A Gentle Introduction to Controlled Query Evaluation in DL-Lite OntologiesSN Computer Science10.1007/s42979-024-02652-45:4Online publication date: 27-Mar-2024
https://dl.acm.org/doi/10.1007/s42979-024-02652-4
Leclère MMugnier MPérution-Kihli GMarquis PSon TKern-Isberner G(2023)Query rewriting with disjunctive existential rules and mappingsProceedings of the 20th International Conference on Principles of Knowledge Representation and Reasoning10.24963/kr.2023/42(429-439)Online publication date: 2-Sep-2023
https://dl.acm.org/doi/10.24963/kr.2023/42
Fagin RKolaitis PLembo DPopa LScafoglieri FMarquis PSon TKern-Isberner G(2023)A framework for combining entity resolution and query answering in knowledge basesProceedings of the 20th International Conference on Principles of Knowledge Representation and Reasoning10.24963/kr.2023/23(229-239)Online publication date: 2-Sep-2023
https://dl.acm.org/doi/10.24963/kr.2023/23
Lanzinger MNissl MSallinger EWałęga PElkind E(2023)Temporal datalog with existential quantificationProceedings of the Thirty-Second International Joint Conference on Artificial Intelligence10.24963/ijcai.2023/365(3277-3285)Online publication date: 19-Aug-2023
https://dl.acm.org/doi/10.24963/ijcai.2023/365
Cima GConsole MLenzerini MPoggi AWilliams BChen YNeville J(2023)Epistemic disjunctive datalog for querying knowledge basesProceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence and Thirty-Fifth Conference on Innovative Applications of Artificial Intelligence and Thirteenth Symposium on Educational Advances in Artificial Intelligence10.1609/aaai.v37i5.25773(6280-6288)Online publication date: 7-Feb-2023
https://dl.acm.org/doi/10.1609/aaai.v37i5.25773
Calvanese DGianola AMazzullo AMontali MWilliams BChen YNeville J(2023)SMT safety verification of ontology-based processesProceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence and Thirty-Fifth Conference on Innovative Applications of Artificial Intelligence and Thirteenth Symposium on Educational Advances in Artificial Intelligence10.1609/aaai.v37i5.25772(6271-6279)Online publication date: 7-Feb-2023
https://dl.acm.org/doi/10.1609/aaai.v37i5.25772
Calautti MMilani MPieris A(2023)Semi-Oblivious Chase Termination for Linear Existential Rules: An Experimental StudyProceedings of the VLDB Endowment10.14778/3611479.361149316:11(2858-2870)Online publication date: 24-Aug-2023
https://dl.acm.org/doi/10.14778/3611479.3611493
Show More Cited By

View Options

View options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Issue’s Table of Contents