On the interaction of existential rules and equality constraints in ontology querying

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 7265, Issue , 2012, Pages 117-133

  Calì, Andrea ^b,c   Gottlob, Georg ^a,c,d   Orsi, Giorgio ^a,d   Pieris, Andreas ^a  

^a UNIVERSITY OF OXFORD   (United Kingdom)

^b UNIVERSITY OF LONDON   (United Kingdom)

^c UNIVERSITY OF OXFORD   (United Kingdom)

^d UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

CONCEPTUAL MODELLING; DATA BASE THEORY; DATALOG; EQUALITY CONSTRAINTS; EXISTENTIAL QUANTIFICATIONS; ONTOLOGICAL CONSTRAINTS; ONTOLOGICAL QUERY; QUERY ANSWERING; RESEARCH TOPICS; UNDECIDABILITY;

COMPUTABILITY AND DECIDABILITY; KNOWLEDGE REPRESENTATION; LOGIC PROGRAMMING; ONTOLOGY; SEMANTICS;

QUERY PROCESSING;

EID: 84864264846     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-30743-0_9     Document Type: Article

References (27)

1. Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison-Wesley (1995
2. Artale, A., Calvanese, D., Kontchakov, R., Ryzhikov, V., Zakharyaschev, M.: Reasoning over Extended ER Models. In: Parent, C., Schewe, K.-D., Storey, V.C., Thalheim, B. (eds.) ER 2007. LNCS, vol. 4801, pp. 277-292. Springer, Heidelberg (2007
3. Beeri, C., Vardi, M.Y.: The Implication Problem for Data Dependencies. In: Even, S., Kariv, O. (eds.) ICALP 1981. LNCS, vol. 115, pp. 73-85. Springer, Heidelberg (1981
4. Berardi, D., Calvanese, D., De Giacomo, G.: Reasoning on UML class diagrams. Artif. Intell. 168(1-2), 70-118 (2005
5. Cal̀i, A., Gottlob, G., Kifer, M.: Taming the infinite chase: Query answering under expressive relational constraints. In: Proc. of KR, pp. 70-80 (2008
6. Cal̀i, A., Gottlob, G., Lukasiewicz, T.: A general Datalog-based framework for tractable query answering over ontologies. In: Proc. of PODS, pp. 77-86 (2009); To appear in the J. of Web Semantics
7. Cal̀i, A., Gottlob, G., Orsi, G., Pieris, A.: Querying UML Class Diagrams. In: Birkedal, L. (ed.) FOSSACS 2012. LNCS, vol. 7213, pp. 1-25. Springer, Heidelberg (2012)
8. Cal̀i, A., Gottlob, G., Pieris, A.: Advanced processing for ontological queries. PVLDB 3(1), 554-565 (2010
9. Cal̀i, A., Gottlob, G., Pieris, A.: Querying Conceptual Schemata with Expressive Equality Constraints. In: Jeusfeld, M., Delcambre, L., Ling, T.-W. (eds.) ER 2011. LNCS, vol. 6998, pp. 161-174. Springer, Heidelberg (2011
10. Cal̀i, A., Gottlob, G., Pieris, A.: Ontological query answering under expressive Entity-Relationship schemata. Inf. Syst. 37(4), 320-335 (2012
11. Cal̀i, A., Kifer, M.: Containment of conjunctive object meta-queries. In: Proc. of VLDB, pp. 942-952 (2006
12. Cal̀i, A., Lembo, D., Rosati, R.: On the decidability and complexity of query answering over inconsistent and incomplete databases. In: Proc. of PODS, pp. 260- 271 (2003
13. 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
14. Calvanese, D., De Giacomo, G., Lenzerini, M.: Identification constraints and functional dependencies in description logics. In: Proc. of IJCAI, pp. 155-160 (2001
15. Chandra, A.K., Merlin, P.M.: Optimal implementation of conjunctive queries in relational data bases. In: Proc. of STOCS, pp. 77-90 (1977
16. Chandra, A.K., Vardi, M.Y.: The implication problem for functional and inclusion dependencies. SIAM J. of Comput. 14, 671-677 (1985
17. Chen, P.P.: The Entity-Relationship model: Towards a unified view of data. ACM Trans. Database Syst. 1(1), 124-131 (1976
18. Fagin, R., Kolaitis, P.G., Miller, R.J., Popa, L.: Data exchange: Semantics and query answering. Theor. Comput. Sci. 336(1), 89-124 (2005
19. Fan, W., Geerts, F., Jia, X.: A revival of integrity constraints for data cleaning. PVLDB 1(2), 1522-1523 (2008
20. 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
21. Kifer, M., Lausen, G., Wu, J.: Logical foundations of object-oriented and framebased languages. J. ACM 42(4), 741-843 (1995
22. Krötzsch, M., Rudolph, S.: Extending decidable existential rules by joining acyclicity and guardedness. In: Proc. of IJCAI, pp. 963-968 (2011
23. Lenzerini, M.: Data integration: A theoretical perspective. In: Proc. of PODS, pp. 233-246 (2002
24. Lloyd, J.W.: Foundations of logic programming. Springer (1987
25. Maier, D., Mendelzon, A.O., Sagiv, Y.: Testing implications of data dependencies. ACM Trans. Database Syst. 4(4), 455-469 (1979
26. Poggi, A., Lembo, D., Calvanese, D., De Giacomo, G., Lenzerini, M., Rosati, R.: Linking data to ontologies. J. Data Semantics 10, 133-173 (2008
27. Sowa, J.F.: Knowledge representation: Logical, philosophical and computational foundations. Brooks/Cole Publishing Co. (2000