Towards more expressive ontology languages: The query answering problem

Artificial Intelligence

Volumn 193, Issue , 2012, Pages 87-128

  Cali', Andrea ^b,c   Gottlob, Georg ^a,b   Pieris, Andreas ^a  

^a UNIVERSITY OF OXFORD   (United Kingdom)

^b UNIVERSITY OF OXFORD   (United Kingdom)

^c UNIVERSITY OF LONDON   (United Kingdom)

Author keywords

Chase procedure; Complexity; Conjunctive queries; Constraints; Datalog; Dependencies; Ontologies; Query answering; Semantic Web; Tractability

Indexed keywords

CHASE PROCEDURE; COMPLEXITY; CONJUNCTIVE QUERIES; CONSTRAINTS; DATALOG; DEPENDENCIES; QUERY ANSWERING; TRACTABILITY;

DATA DESCRIPTION; FORMAL LANGUAGES; QUERY LANGUAGES; QUERY PROCESSING; SEMANTIC WEB;

ONTOLOGY;

EID: 84869118273     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.artint.2012.08.002     Document Type: Article

References (65)

1. A. Calì, G. Gottlob, and A. Pieris Advanced processing for ontological queries Proceedings of the VLDB Endowment 3 2010 554 565
2. A. Calì, G. Gottlob, A. Pieris, Query answering under non-guarded rules in Datalog+/-, in: Proceeding of the 4th International Conference on Web Reasoning and Rule Systems, 2010, pp. 1-17.
3. A. Acciarri, D. Calvanese, G.D. Giacomo, D. Lembo, M. Lenzerini, M. Palmieri, R. Rosati, QuOnto: Querying ontologies, in: Proceedings of the 20th National Conference on Artificial Intelligence and the 17th Innovative Applications of Artificial Intelligence Conference, 2005, pp. 1670-1671. (Pubitemid 43006534)
4. D. Calvanese, G. De Giacomo, D. Lembo, M. Lenzerini, and R. Rosati Tractable reasoning and efficient query answering in description logics: The DL-Lite family Journal of Automated Reasoning 39 2007 385 429 (Pubitemid 47340922)
5. D.S. Johnson, and A.C. Klug Testing containment of conjunctive queries under functional and inclusion dependencies Journal of Computer and System Sciences 28 1984 167 189 (Pubitemid 14569352)
6. A. Calì, D. Lembo, R. Rosati, Decidability and complexity of query answering over inconsistent and incomplete databases, in: Proceedings of the 22nd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2003, pp. 260-271.
7. R. Fagin, P.G. Kolaitis, R.J. Miller, and L. Popa Data exchange: Semantics and query answering Theoretical Computer Science 336 2005 89 124 (Pubitemid 40612385)
8. A. Deutsch, A. Nash, J.B. Remmel, The chase revisited, in: Proceedings of the 27th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2008, pp. 149-158.
9. C. Beeri, M.Y. Vardi, The implication problem for data dependencies, in: Proceedings of the 8th International Colloquium on Automata, Languages and Programming, 1981, pp. 73-85.
10. A. Poggi, D. Lembo, D. Calvanese, G. De Giacomo, M. Lenzerini, and R. Rosati Linking data to ontologies Journal on Data Semantics 10 2008 133 173
11. S. Abiteboul, R. Hull, and V. Vianu Foundations of Databases 1995 Addison-Wesley
12. A. Calì, G. Gottlob, and T. Lukasiewicz A general Datalog-based framework for tractable query answering over ontologies Journal of Web Semantics 14 2012 57 83
13. B. Faltings, and S.M. Gonzalez Open constraint programming Artificial Intelligence 161 2005 181 208
14. D. Mailharrow A classification and constraint-based framework for configuration Artificial Intelligence for Engineering, Design, Analysis and Manufacturing 12 1998 383 397
15. L. Cabibbo The expressive power of stratified logic programs with value invention Information and Computation 147 1998 22 56 (Pubitemid 128453326)
16. P.F. Patel-Schneider, and I. Horrocks A comparison of two modelling paradigms in the semantic web Journal of Web Semantics 5 2007 240 250 (Pubitemid 350186144)
17. P.P. Chen The Entity-Relationship model: Towards a unified view of data ACM Transactions on Database Systems 1 1976 9 36
18. D. Berardi, D. Calvanese, and G.D. Giacomo Reasoning on UML class diagrams Artificial Intelligence 168 2005 70 118 (Pubitemid 41338772)
19. A. Calì, G. Gottlob, M. Kifer, Taming the infinite chase: Query answering under expressive relational constraints, in: Proceedings of the 11th International Conference on Principles of Knowledge Representation and Reasoning, 2008, pp. 70-80.
20. B. Marnette, Generalized schema-mappings: From termination to tractability, in: Proceedings of the 28th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2009, pp. 13-22.
21. J.-F. Baget, M.-L. Mugnier, S. Rudolph, M. Thomazo, Walking the complexity lines for generalized guarded existential rules, in: Proceedings of the 22nd International Joint Conference on Artificial Intelligence, 2011, pp. 712-717.
22. H. Andréka, J. van Benthem, and I. Németi Modal languages and bounded fragments of predicate logic Journal of Philosophical Logic 27 1998 217 274
23. E. Dantsin, T. Eiter, G. Georg, and A. Voronkov Complexity and expressive power of logic programming ACM Computing Surveys 33 2001 374 425 (Pubitemid 33768487)
24. J. Panttaya, Complexity in databases, games, and logics, Ph.D. thesis, University of California Santa Cruz, 2006.
25. P.G. Kolaitis, J. Panttaja, W.-C. Tan, The complexity of data exchange, in: Proceedings of the 25th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2006, pp. 30-39. (Pubitemid 46946464)
26. P.G. Kolaitis, J. Panttaja, personal communication, 2009.
27. C.H. Papadimitriou Computational Complexity 1994 Addison-Wesley
28. J.-F. Baget, M. Leclère, M.-L. Mugnier, and E. Salvat On rules with existential variables: Walking the decidability line Artificial Intelligence 175 2011 1620 1654
29. M.Y. Vardi, The complexity of relational query languages, in: Proceedings of the 14th ACM Symposium on Theory of Computing, 1982, pp. 137-146.
30. A.K. Chandra, P.M. Merlin, Optimal implementation of conjunctive queries in relational data bases, in: Proceedings of the 9th Annual ACM Symposium on Theory of Computing, 1997, pp. 77-90.
31. D. Maier, A.O. Mendelzon, and Y. Sagiv Testing implications of data dependencies ACM Transactions on Database Systems 4 1979 455 469
32. A.K. Chandra, D. Kozen, and L.J. Stockmeyer Alternation, Journal of the ACM 28 1981 114 133
33. M.Y. Vardi, On the complexity of bounded-variable queries, in: Proceedings of the 14th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1995, pp. 266-276.
34. R. Fagin, P.G. Kolaitis, and L. Popa Data exchange: Getting to the core ACM Transactions on Database Systems 30 2005 174 210 (Pubitemid 41201814)
35. G. Gottlob, and A. Nash Efficient core computation in data exchange Journal of the ACM 55 2008 http://dx.doi.org/10.1145/1346330.1346334
36. A.K. Chandra, and M.Y. Vardi The implication problem for functional and inclusion dependencies SIAM Journal of Computing 14 1985 671 677
37. D. Calvanese, G.D. Giacomo, D. Lembo, M. Lenzerini, R. Rosati, Data complexity of query answering in description logics, in: Proceedings of the 10th International Conference on Principles of Knowledge Representation and Reasoning, 2006, pp. 260-270.
38. T. Berners-Lee, J.A. Hendler, and O. Lassila The semantic web Scientific American 284 2002 34 43
39. I. Horrocks, O. Kutz, U. Sattler, The even more irresistible SROIQ, in: Proceedings of the 10th International Conference on Principles of Knowledge Representation and Reasoning, 2006, pp. 57-67.
40. A. Artale, D. Calvanese, R. Kontchakov, and M. Zakharyaschev The DL-Lite family and relations Journal of Artificial Intelligence Research 36 2009 1 69
41. F. Baader, S. Brandt, C. Lutz, Pushing the EL envelope, in: Proceedings of the 19th International Joint Conference on Artificial Intelligence, 2005, pp. 364-369.
42. F. Baader, Least common subsumers and most specific concepts in a description logic with existential restrictions and terminological cycles, in: Proceedings of the 18th International Joint Conference on Artificial Intelligence, 2003, pp. 319-324.
43. B.N. Grosof, I. Horrocks, R. Volz, S. Decker, Description logic programs: Combining logic programs with description logic, in: Proceedings of the 12th International World Wide Web Conference, 2003, pp. 48-57.
44. M. Krötzsch, S. Rudolph, P. Hitzler, ELP: Tractable rules for OWL 2, in: Proceedings of the 7th International Semantic Web Conference, 2008, pp. 649-664.
45. A. Calì, G. Gottlob, and A. Pieris Ontological query answering under expressive Entity-Relationship schemata Information Systems 37 2012 320 335
46. T. Eiter, and M. Simkus FDNC: Decidable nonmonotonic disjunctive logic programs with function symbols ACM Transactions on Computational Logic 11 2010 http://dx.doi.org/10.1145/1656242.1656249
47. A. Calì, M. Kifer, Containment of conjunctive object meta-queries, in: Proceedings of the 32nd International Conference on Very Large Data Bases, 2006, pp. 942-952.
48. M. Kifer, G. Lausen, and J. Wu Logical foundations of object-oriented and frame-based languages Journal of the ACM 42 1995 741 843
49. E. Salvat, M.-L. Mugnier, Sound and complete forward and backward chaining of graph rules, in: Proceedings of the 4th International Conference on Conceptual Structures, 1996, pp. 248-262. (Pubitemid 126107981)
50. H. Pérez-Urbina, B. Motik, and I. Horrocks Tractable query answering and rewriting under description logic constraints Journal of Applied Logic 8 2010 186 209
51. R. Rosati, A. Almatelli, Improving query answering over DL-Lite ontologies, in: Proceedings of the 12th International Conference on Principles of Knowledge Representation and Reasoning, 2010, pp. 290-300.
52. G. Orsi, and A. Pieris Optimizing query answering under ontological constraints Proceedings of the VLDB Endowment 4 2011 1004 1015
53. R. Rosati, On conjunctive query answering in EL, in: Proceedings of the 20th International Workshop on Description Logics, in: CEUR Workshop Proceedings, vol. 250, 2007, Paper 83.
54. C. Lutz, D. Toman, F. Wolter, Conjunctive query answering in the description logic EL using a relational database system, in: Proceedings of the 21st International Joint Conference on Artificial Intelligence, 2009, pp. 2070-2075.
55. A. Calì, G. Gottlob, A. Pieris, Query rewriting under non-guarded rules, in: Proceedings of the 4th Alberto Mendelzon International Workshop on Foundations of Data Management, in: CEUR Workshop Proceedings, vol. 619, 2010, Paper 12.
56. G. Gottlob, G. Orsi, A. Pieris, Ontological queries: Rewriting and optimization, in: Proceedings of the 27th International Conference on Data Engineering, 2011, pp. 2-13.
57. G. Gottlob, T. Schwentick, Rewriting ontological queries into small nonrecursive Datalog programs, in: Proceedings of the 13th International Conference on Principles of Knowledge Representation and Reasoning, 2012, pp. 254-263.
58. R. Kontchakov, C. Lutz, D. Toman, F. Wolter, M. Zakharyaschev, The combined approach to query answering in DL-Lite, in: Proceedings of the 12th International Conference on Principles of Knowledge Representation and Reasoning, 2010, pp. 247-257.
59. R. Kontchakov, C. Lutz, D. Toman, F. Wolter, M. Zakharyaschev, The combined approach to ontology-based data access, in: Proceedings of the 22nd International Joint Conference on Artificial Intelligence, 2011, pp. 2656-2661.
60. R. Rosati On the finite controllability of conjunctive query answering in databases under open-world assumption Journal of Computer and System Sciences 77 2011 572 594
61. V. Barany, G. Gottlob, M. Otto, Querying the guarded fragment, in: Proceedings of the 25th IEEE Symposium on Logic in Computer Science, 2010, pp. 1-10.
62. T. Gogacz, J. Marcinkowski, personal communication, 2012.
63. R. Rosati, Finite model reasoning in DL-Lite, in: Proceedings of the 5th European Semantic Web Conference, 2008, pp. 215-229.
64. R.G. Downey, and M.R. Fellows Parameterized Complexity 1999 Springer-Verlag
65. D. Kozen, Lower bounds for natural proof systems, in: Proceedings of the 18th Annual Symposium on Foundations of Computer Science, 1997, pp. 254-266.