Tractable query answering and rewriting under description logic constraints

Journal of Applied Logic

Volumn 8, Issue 2, 2010, Pages 186-209

  Pérez Urbina, Héctor ^a   Motik, Boris ^a   Horrocks, Ian ^a  

^a UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

Description logics; Incomplete databases; Query answering; Query rewriting

Indexed keywords

ANSWERING QUERIES; COMPUTATIONAL TASK; CONJUNCTIVE QUERIES; CONSTRAINT LANGUAGE; DATA COMPLEXITY; DATABASE TECHNOLOGY; DATALOG; DESCRIPTION LOGIC; IN-FIELD; INFORMATION INTEGRATION; METADATA MANAGEMENT; MODELING CONSTRUCT; QUERY ANSWERING; QUERY REWRITINGS;

COMPUTABILITY AND DECIDABILITY; DATA DESCRIPTION; METADATA; SEMANTICS;

QUERY LANGUAGES;

EID: 77549087969     PISSN: 15708683     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jal.2009.09.004     Document Type: Article

References (40)

1. Abiteboul S., Hull R., and Vianu V. Foundations of Databases (1995), Addison-Wesley
2. Baader F., Brandt S., and Lutz C. Pushing the EL envelope. In: Kaelbling L.P., and Saffiotti A. (Eds). IJCAI (2005), Professional Book Center 364-369
3. Baader F., and Nutt W. Basic Description Logics (2003), Cambridge University Press pp. 47-100 (Chapter 2)
4. F. Baader, W. Snyder, Unification theory, in: Robinson and Voronkov [34], pp. 445-532 (Chapter 8)
5. L. Bachmair, H. Ganzinger, Resolution theorem proving, in: Robinson and Voronkov [34], pp. 19-99 (Chapter 2)
6. Calì A. Querying incomplete data with logic programs: Er strikes back. In: Parent C., Schewe K.-D., Storey V.C., and Thalheim B. (Eds). ER. Lecture Notes in Computer Science vol. 4801 (2007), Springer 245-260
7. Calì A., Gottlob G., and Kifer M. Taming the infinite chase: Query answering under expressive relational constraints. In: Brewka G., and Lang J. (Eds). KR (2008), AAAI Press 70-80
8. Calì A., Gottlob G., and Lukasiewickz T. A general datalog-based framework for tractable query answering over ontologies. PODS '09: Proceedings of the Twenty-Seventh ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (2009), ACM, New York, NY, USA 69-78
9. Calì A., and Kifer M. Containment of conjunctive object meta-queries. In: Dayal U., Whang K.-Y., Lomet D.B., Alonso G., Lohman G.M., Kersten M.L., Cha S.K., and Kim Y.-K. (Eds). VLDB (2006), ACM 942-952
10. Calì A., Lukasiewicz T., Predoiu L., and Stuckenschmidt H. Tightly integrated probabilistic description logic programs for representing ontology mappings. In: Hartmann S., and Kern-Isberner G. (Eds). FoIKS. Lecture Notes in Computer Science vol. 4932 (2008), Springer 178-198
11. Calvanese D., De Giacomo G., Lembo D., Lenzerini M., and Rosati R. Tractable reasoning and efficient query answering in description logics: The DL-Lite family. Journal of Automated Reasoning 9 (2007) 385-429
12. In: Calvanese D., Franconi E., Haarslev V., Lembo D., Motik B., Turhan A.-Y., and Tessaris S. (Eds). Proceedings of the 2007 International Workshop on Description Logics (DL2007). Brixen-Bressanone, near Bozen-Bolzano, Italy, 8-10 June, 2007. CEUR Workshop Proceedings vol. 250 (2007), CEUR-WS.org
13. Calvanese D., Giacomo G.D., Lembo D., Lenzerini M., and Rosati R. Data complexity of query answering in description logics. In: Doherty P., Mylopoulos J., and Welty C.A. (Eds). KR (2006), AAAI Press 260-270
14. Calvanese D., Giacomo G.D., Lenzerini M., Nardi D., and Rosati R. Description logic framework for information integration. In: Cohn A.G., Schubert L.K., and Shapiro S.C. (Eds). Principles of Knowledge Representation and Reasoning (1998), Morgan Kaufmann 2-13
15. E. Dantsin, T. Eiter, G. Gottlob, A. Voronkov, Complexity and expressive power of logic programming, in: IEEE Conference on Computational Complexity, 1997, pp. 82-101
16. Fagin R., Kolaitis P.G., Miller R.J., and Popa L. Data exchange: Semantics and query answering. In: Calvanese D., Lenzerini M., and Motwani R. (Eds). ICDT. Lecture Notes in Computer Science vol. 2572 (2003), Springer 207-224
17. Fitting M. First-Order Logic and Automated Theorem Proving. 2nd ed. (1996), Springer-Verlag, New York, Inc., Secaucus, NJ, USA
18. Fuxman A., and Miller R.J. First-order query rewriting for inconsistent databases. J. Comput. System Sci. 73 4 (2007) 610-635
19. Gelfond M., and Lifschitz V. The stable model semantics for logic programming. Proc. of the 5th Int. Conf. on Logic Programming (ICLP '88). Seattle, WA, USA, August 15-19, 1988 (1988), MIT Press 1070-1080
20. Green C. Theorem proving by resolution as a basis for question-answering systems. In: Meltzer B., and Michie D. (Eds). 4th Annual Machine Intelligence Workshop (1969), Edinburgh University Press 183-208
21. Heflin J., and Hendler J. A portrait of the semantic web in action. IEEE Intelligent Systems 16 2 (2001) 54-59
22. Joyner W.H. Resolution strategies as decision procedures. J. ACM 23 3 (1976) 398-417
23. Kanellakis P.C., Kuper G.M., and Revesz P.Z. Constraint query languages. Proceedings of the Ninth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems. April 2-4, 1990, Nashville, Tennessee (1990), ACM Press 299-313
24. Y. Kazakov, Saturation-based decision procedures for extensions of the guarded fragment, PhD thesis, Universität des Saarlandes, Saarbrücken, Germany, March 2006
25. Kifer M., Lausen G., and Wu J. Logical foundations of object-oriented and frame-based languages. J. ACM 42 4 (1995) 741-843
26. A. Krisnadhi, C. Lutz, Data complexity in the EL family of dls, in: D. Calvanese et al. [12]
27. M. Krotzsch, S. Rudolph, Conjunctive queries for EL with role composition, in: D. Calvanese et al. [12]
28. Lenzerini M. Data integration: A theoretical perspective. In: Popa L. (Ed). PODS '02: Proceedings of the Twenty-First ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (2002), ACM Press, New York, NY, USA 233-246
29. Levy A.Y. Answering queries using views: A survey. Very Large Databases Journal 10 (2001) 270-294
30. Lutz C., Toman D., and Wolter F. Conjunctive query answering in the description logic EL using a relational database system. Proceedings of the 21st International Joint Conference on Artificial Intelligence IJCAI09 (2009), AAAI Press
31. B. Motik, Reasoning in description logics using resolution and deductive databases, PhD thesis, Universität Karlsruhe (TH), Karlsruhe, Germany, January 2006
32. H. Pérez-Urbina, B. Motik, I. Horrocks, Rewriting conjunctive queries over description logic knowledge bases, in: Proceedings of the International Workshop on Semantics in Data and Knowledge Bases, March 2008
33. H. Pérez-Urbina, B. Motik, I. Horrocks, Rewriting conjunctive queries under description logic constraints, in: Proceedings of the International Workshop on Logics in Databases, May 2008
34. In: Robinson J.A., and Voronkov A. (Eds). Handbook of Automated Reasoning (2001), Elsevier/MIT Press (in 2 volumes)
35. R. Rosati, On conjunctive query answering in EL, in: D. Calvanese et al. [12]
36. Rosati R. The limits of querying ontologies. In: Schwentick T., and Suciu D. (Eds). ICDT. Lecture Notes in Computer Science vol. 4353 (2007), Springer 164-178
37. Simkus M., and Eiter T. Dnc: Decidable non-monotonic disjunctive logic programs with function symbols. In: Dershowitz N., and Voronkov A. (Eds). LPAR. Lecture Notes in Computer Science vol. 4790 (2007), Springer 514-530
38. van der Meyden R. Logical approaches to incomplete information: A survey. In: Chomicki J., and Saake G. (Eds). Logics for Databases and Information Systems (1998), Kluwer 307-356
39. Vardi M.Y. The complexity of relational query languages (extended abstract). In: Lewis H.R., Simons B.B., Burkhard W.A., and Landweber L. (Eds). Proc. of the 14th Annual ACM Symposium on Theory of Computing (STOC '82). San Francisco, CA, USA, May 5-7 (1982), ACM Press 137-146
40. J. Widom, Research problems in data warehousing, in: CIKM '95, Proceedings of the 1995 International Conference on Information and Knowledge Management, November 28-December 2, 1995, Baltimore, Maryland, USA, 1995, pp. 25-30