A logical toolbox for ontological reasoning

SIGMOD Record

Volumn 40, Issue 3, 2011, Pages 5-14

  Calì, Andrea ^a,c   Gottlob, Georg ^b,c  

^a UNIVERSITY OF LONDON   (United Kingdom)

^b UNIVERSITY OF OXFORD   (United Kingdom)

^c UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPLEXITY RESULTS; COMPUTATIONAL PROPERTIES; DATA SIZE; DATABASE SCHEMAS; DATALOG; LOGICAL THEORIES; ONTOLOGICAL REASONING; ONTOLOGY MODELING; ONTOLOGY-BASED QUERY; QUERY ANSWERING;

INFORMATION SYSTEMS; SOFTWARE ENGINEERING;

DATABASE SYSTEMS;

EID: 84858419173     PISSN: 01635808     EISSN: None     Source Type: Journal    
DOI: 10.1145/2070736.2070738     Document Type: Article

References (41)

1. S. Abiteboul, R. Hull, and V. Vianu. Foundations of Databases. Addison-Wesley, 1995.
2. P. Alvaro, W. Marczak, N. Conway, J. M. Hellerstein, D. Maier, and R. C. Sears. Towards scalable architectures for clickstream data warehousing. Technical report, EECS Department, University of California, Berkeley, 2009.
3. H. Andréka, J. van Benthem, and I. Németi. Modal languages and bounded fragments of predicate logic. J. Philosophical Logic, 27:217-274, 1998.
4. J.-F. Baget, M. Leclère, M.-L. Mugnier, and E. Salvat. On rules with existential variables: Walking the decidability line. Artif. Intell., 175(9-10):1620-1654, 2011.
5. V. Bárány, G. Gottlob, and M. Otto. Querying the guarded fragment. In Proc. of LICS, pages 1-10, 2010.
6. R. Baumgartner, S. Flesca, and G. Gottlob. Visual web information extraction with Lixto. In Proc. of VLDB, pages 119-128, 2001.
7. R. Baumgartner, W. Gatterbauer, and G. Gottlob. Monadic Datalog and the expressive power of web information extraction languages. In L. Liu and M. T. özsu, editors, Encyclopedia of Database Systems, pages 3465-3471. Springer-Verlag New York, Inc., 2009.
8. C. Beeri and M. Y. Vardi. The implication problem for data dependencies. In Proc. of ICALP, pages 73-85, 1981.
9. D. Brickley and R. V. Guha. RDF vocabulary description language 1.0: RDF Schema. http://www.w3.org/TR/2004/REC-rdf-schema- 20040210/, 2004. W3C Recommendation.
10. L. Cabibbo. The expressive power of stratified logic programs with value invention. Inf. Comput., 147(1):22-56, 1998. (Pubitemid 128453326)
11. A. Calì, G. Gottlob, and M. Kifer. Taming the infinite chase: Query answering under expressive relational constraints. In Proc. of KR, pages 70-80, 2008.
12. A. Calì, G. Gottlob, and T. Lukasiewicz. A general datalog-based framework for tractable query answering over ontologies. In Proc. of PODS, pages 77-86, 2009.
13. A. Calì, G. Gottlob, and A. Pieris. Towards more expressive ontology langugaes: The query answering problem. Unpublished Manuscript.
14. A. Calì, G. Gottlob, and A. Pieris. Advanced processing for ontological queries. PVLDB, 3(1):554-565, 2010.
15. A. Calì, G. Gottlob, and A. Pieris. Query rewriting under non-guarded rules. In Proc. AMW, 2010.
16. A. Calì, D. Lembo, and R. Rosati. On the decidability and complexity of query answering over inconsistent and incomplete databases. In Proc. of PODS, pages 260-271, 2003.
17. D. Calvanese. Finite model reasoning in description logics. In Proc. of KR, pages 292-303, 1996.
18. 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. J. Autom. Reasoning, 39(3):385-429, 2007. (Pubitemid 47340922)
19. M. A. Casanova, R. Fagin, and C. H. Papadimitriou. Inclusion dependencies and their interaction with functional dependencies. J. Comput. Syst. Sci., 28:29-59, 1984. (Pubitemid 14569358)
20. A. K. Chandra and P. M. Merlin. Optimal implementation of conjunctive queries in relational data bases. In Proc. of STOCS, pages 77-90, 1977.
21. A. K. Chandra and M. Y. Vardi. The implication problem for functional and inclusion dependencies. SIAM Journal of Computing, 14:671-677, 1985.
22. J. de Bruijn and S. Heymans. Logical foundations of (e)RDF(S): Complexity and reasoning. In Proc. of ISWC, pages 86-99, 2007.
23. A. Deutsch, A. Nash, and J. B. Remmel. The chase revisisted. In Proc. of PODS, pages 149-158, 2008.
24. R. Fagin, P. G. Kolaitis, R. J. Miller, and L. Popa. Data exchange: Semantics and query answering. Theor. Comput. Sci., 336(1):89-124, 2005. (Pubitemid 40612385)
25. G. Gottlob and C. Koch. Monadic Datalog and the expressive power of web information extraction languages. J. ACM, 51(1):71-113, 2004.
26. G. Gottlob and C. H. Papadimitriou. On the complexity of single-rule Datalog queries. Inf. and Comput., 183(1):104-122, 2003.
27. G. Gottlob and T. Schwentick. Rewriting ontological queries into small non-recursive Datalog programs. In Proc. of DL, 2011.
28. E. Hajiyev, M. Verbaere, and O. de Moor. codeQuest: scalable source code queries with Datalog. In Proc. of ECOOP, pages 2-27, 2006. (Pubitemid 44153399)
29. D. S. Johnson and A. C. Klug. Testing containment of conjunctive queries under functional and inclusion dependencies. J. Comput. Syst. Sci., 28(1):167-189, 1984. (Pubitemid 14569352)
30. C. Lutz, U. Sattler, and L. Tendera. The complexity of finite model reasoning in description logics. Inf. Comput., 199(1-2):132-171, 2005. (Pubitemid 40773677)
31. D. Maier, A. O. Mendelzon, and Y. Sagiv. Testing implications of data dependencies. ACM Trans. Database Syst., 4(4):455-469, 1979.
32. D. Mailharrow. A classification and constraint-based framework for configuration. Artif. Intell. for Engineering Design, Analysis and Manufacturing, 12(4):383-397, 1998.
33. B. Marnette. Generalized schema-mappings: from termination to tractability. In Proc. of PODS, pages 13-22, 2009.
34. P. F. Patel-Schneider and I. Horrocks. A comparison of two modelling paradigms in the semantic web. J. Web Semantics, 5(4):240-250, 2007. (Pubitemid 350186144)
35. A. Poggi, D. Lembo, D. Calvanese, G. De Giacomo, M. Lenzerini, and R. Rosati. Linking data to ontologies. J. Data Semantics, 10:133-173, 2008.
36. R. Rosati. Finite model reasoning in DL-lite. In Semantic Web Conf., pages 215-229, 2008.
37. R. Rosati. On the finite controllability of conjunctive query answering in databases under open-world assumption. J. Comput. Syst. Sci., 77(3):572-594, 2011.
38. S. Rudolph, M. Krötzsch, and P. Hitzler. All elephants are bigger than all mice. In Description Logics, 2008.
39. M. Y. Vardi. The complexity of relational query languages. In Proc. of STOC, pages 137-146, 1982.
40. M. Y. Vardi, 1984. Personal communication reported in [29].
41. M. Y. Vardi. On the complexity of bounded-variable queries. In Proc. of PODS, pages 266-276, 1995.