Tractable query answering and rewriting under description logic constraints

Abiteboul, 1995 Baader, 2005, Pushing the EL envelope, 364 Baader, 2003 F. Baader, W. Snyder, Unification theory, in: Robinson and Voronkov [34], pp. 445–532 (Chapter 8) L. Bachmair, H. Ganzinger, Resolution theorem proving, in: Robinson and Voronkov [34], pp. 19–99 (Chapter 2) Calì, 2007, Querying incomplete data with logic programs: Er strikes back, vol. 4801, 245 Calì, 2008, Taming the infinite chase: Query answering under expressive relational constraints, 70 Calì, 2009, A general datalog-based framework for tractable query answering over ontologies, 69 Calì, 2006, Containment of conjunctive object meta-queries, 942 Calì, 2008, Tightly integrated probabilistic description logic programs for representing ontology mappings, vol. 4932, 178 Calvanese, 2007, Tractable reasoning and efficient query answering in description logics: The DL-Lite family, Journal of Automated Reasoning, 9, 385, 10.1007/s10817-007-9078-x 2007, vol. 250 Calvanese, 2006, Data complexity of query answering in description logics, 260 Calvanese, 1998, Description logic framework for information integration, 2 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 Fagin, 2003, Data exchange: Semantics and query answering, vol. 2572, 207 Fitting, 1996 Fuxman, 2007, First-order query rewriting for inconsistent databases, J. Comput. System Sci., 73, 610, 10.1016/j.jcss.2006.10.013 Gelfond, 1988, The stable model semantics for logic programming, 1070 Green, 1969, Theorem proving by resolution as a basis for question-answering systems, 183 Heflin, 2001, A portrait of the semantic web in action, IEEE Intelligent Systems, 16, 54, 10.1109/5254.920600 Joyner, 1976, Resolution strategies as decision procedures, J. ACM, 23, 398, 10.1145/321958.321960 Kanellakis, 1990, Constraint query languages, 299 Y. Kazakov, Saturation-based decision procedures for extensions of the guarded fragment, PhD thesis, Universität des Saarlandes, Saarbrücken, Germany, March 2006 Kifer, 1995, Logical foundations of object-oriented and frame-based languages, J. ACM, 42, 741, 10.1145/210332.210335 A. Krisnadhi, C. Lutz, Data complexity in the EL family of dls, in: D. Calvanese et al. [12] M. Krotzsch, S. Rudolph, Conjunctive queries for EL with role composition, in: D. Calvanese et al. [12] Lenzerini, 2002, Data integration: A theoretical perspective, 233 Levy, 2001, Answering queries using views: A survey, Very Large Databases Journal, 10, 270 Lutz, 2009, Conjunctive query answering in the description logic EL using a relational database system B. Motik, Reasoning in description logics using resolution and deductive databases, PhD thesis, Universität Karlsruhe (TH), Karlsruhe, Germany, January 2006 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 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 2001 R. Rosati, On conjunctive query answering in EL, in: D. Calvanese et al. [12] Rosati, 2007, The limits of querying ontologies, vol. 4353, 164 Simkus, 2007, Dnc: Decidable non-monotonic disjunctive logic programs with function symbols, vol. 4790, 514 van der Meyden, 1998, Logical approaches to incomplete information: A survey, 307 Vardi, 1982, The complexity of relational query languages (extended abstract), 137 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