Datalog+/-: A family of logical knowledge representation and query languages for new applications

Proceedings - Symposium on Logic in Computer Science

Volumn , Issue , 2010, Pages 228-242

  Calì, Andrea ^b,c   Gottlob, Georg ^a,b   Lukasiewicz, Thomas ^a,d   Marnette, Bruno ^a   Pieris, Andreas ^a  

^a UNIVERSITY OF OXFORD   (United Kingdom)

^b UNIVERSITY OF OXFORD   (United Kingdom)

^c BRUNEL UNIVERSITY   (United Kingdom)

^d VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

Knowledge representation and reasoning; Ontologies; Query answering

Indexed keywords

COMPUTABILITY AND DECIDABILITY; ONTOLOGY; QUERY LANGUAGES;

DATALOG; KNOWLEDGE REPRESENTATION AND REASONING; NEW APPLICATIONS; QUERY ANSWERING;

KNOWLEDGE REPRESENTATION;

EID: 78449294986     PISSN: 10436871     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/LICS.2010.27     Document Type: Conference Paper

References (55)

1. S. Ceri, G. Gottlob, and L. Tanca, Logic Programming and Databases. Springer, 1990.
2. S. Abiteboul, R. Hull, and V. Vianu, Foundations of Databases. Addison-Wesley, 1995.
3. R. Baumgartner, S. Flesca, and G. Gottlob, "Visual web information extraction with Lixto," in Proc. of VLDB, 2001, pp. 119-128.
4. G. Gottlob and C. Koch, "Monadic Datalog and the expressive power of web information extraction languages," J. ACM, vol. 51, no. 1, pp. 71-113, 2004.
5. R. Baumgartner, W. Gatterbauer, and G. Gottlob, "Monadic Datalog and the expressive power of web information extraction languages," in Encyclopedia of Database Systems, L. Liu and M. T. Özsu, Eds. Springer, 2009, pp. 3465-3471.
6. E. Hajiyev, M. Verbaere, and O. de Moor, "codeQuest: scalable source code queries with Datalog," in Proc. of ECOOP, 2006, pp. 2-27.
7. P. Alvaro, W. Marczak, N. Conway, J. M. Hellerstein, D. Maier, and R. C. Sears, "Towards scalable architectures for clickstream data warehousing," EECS Department, University of California, Berkeley, Tech. Rep., 2009.
8. R. J. Miller, M. A. Hernández, L. M. Haas, L. Yan, C. T. Howard Ho, R. Fagin, and L. Popa, "The Clio project: managing heterogeneity," SIGMOD Record, vol. 30, no. 1, pp. 78-83, 2001.
9. F. Baader, D. Calvanese, D. L. McGuinness, D. Nardi, and P. F. Patel-Schneider, Eds., The Description Logic Handbook: Theory, Implementation, and Applications. Cambridge University Press, 2003.
10. C. Beeri and M. Y. Vardi, "The implication problem for data dependencies," in Proc. of ICALP, 1981, pp. 73-85.
11. A. Calì, G. Gottlob, and M. Kifer, "Taming the infinite chase: Query answering under expressive relational constraints," in Proc. of KR, 2008. Full version available from the authors.
12. D. Maier, A. O. Mendelzon, and Y. Sagiv, "Testing implications of data dependencies," ACM TODS, vol. 4, no. 4, pp. 455-469, 1979.
13. D. S. Johnson and A. C. Klug, "Testing containment of conjunctive queries under functional and inclusion dependencies," J. Comput. Syst. Sci., vol. 28, no. 1, pp. 167-189, 1984.
14. R. Fagin, P. G. Kolaitis, and L. Popa, "Data exchange: getting to the core," ACM TODS, vol. 30, no. 1, pp. 174-210, 2005.
15. H. Andréka, J. van Benthem, and I. Németi, "Modal languages and bounded fragments of predicate logic," J. Philosophical Logic, vol. 27, pp. 217-274, 1998.
16. V. Barany, G. Gottlob, and M. Otto, "Querying the guarded fragment," in Proc. of LICS, 2010, this proceedings.
17. 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, vol. 39, no. 3, pp. 385-429, 2007.
18. A. K. Chandra and M. Y. Vardi, "The implication problem for functional and inclusion dependencies," SIAM J. Comput., vol. 14, pp. 671-677, 1985.
19. J.-F. Baget and M.-L. Mugnier, "Extensions of simple conceptual graphs: The complexity of rules and constraints," J. Artif. Intell. Res., vol. 16, pp. 425-465, 2002.
20. J.-F. Baget, M. Leclère, M.-L. Mugnier, and E. Salvat, "Extending decidable cases for rules with existential variables," in Proc. of IJCAI, 2009, pp. 677-682.
21. A. K. Chandra and P. M. Merlin, "Optimal implementation of conjunctive queries in relational data bases," in Proc. of STOC, 1977, pp. 77-90.
22. R. Fagin, P. G. Kolaitis, R. J. Miller, and L. Popa, "Data exchange: semantics and query answering," Theor. Comput. Sci., vol. 336, no. 1, pp. 89-124, 2005.
23. A. Deutsch, A. Nash, and J. B. Remmel, "The chase revisisted," in Proc. of PODS, 2008, pp. 149-158.
24. B. Marnette, "Generalized schema-mappings: from termination to tractability," in Proc. of PODS, 2009, pp. 13-22.
25. A. Deutsch and V. Tannen, "Reformulation of XML queries and constraints," in Proc. of ICDT, 2003, pp. 225-241.
26. M. Meier, M. Schmidt, G. Lausen, "On chase termination beyond stratification," PVLDB, vol. 2, no. 1, pp. 970-981, 2009.
27. E. Grädel, "On the restraining power of guards," J. Symb. Log., vol. 64, no. 4, pp. 1719-1742, 1999.
28. -, "Decision procedures for guarded logics," in Proc. of CADE, 1999, pp. 31-51.
29. M. Otto, "Avoiding incidental homomorphisms into guarded covers," Technische Universität Darmstadt, Tech. Rep., 2009.
30. R. Rosati, "On the decidability and finite controllability of query processing in databases with incomplete information," in Proc. of PODS, 2006, pp. 356-365.
31. A. Calì, G. Gottlob, and T. Lukasiewicz, "A general Datalog-based framework for tractable query answering over ontologies," in Proc. of PODS, 2009, pp. 77-86.
32. M. Y. Vardi, 1984, personal communication reported in [13].
33. M. A. Casanova, R. Fagin, and C. H. Papadimitriou, "Inclusion dependencies and their interaction with functional dependencies," J. Comput. Syst. Sci., vol. 28, pp. 29-59, 1984.
34. G. Gottlob and C. H. Papadimitriou, "On the complexity of single-rule Datalog queries," Inform. Comput., vol. 183, no. 1, pp. 104-122, 2003.
35. M. Y. Vardi, "On the complexity of bounded-variable queries," in Proc. of PODS, 1995, pp. 266-276.
36. K. Apt, H. Blair, and A. Walker, "Towards a theory of declarative knowledge," in Foundations of Deductive Databases and Logic Programming, 1988, pp. 89-148.
37. A. Calì, G. Gottlob, and A. Pieris, "Advanced processing for ontological queries," 2010, unpublished manuscript. Available at http://benner.dbai.tuwien.ac.at/staff/gottlob/CGP.pdf.
38. A. Calì, D. Lembo, and R. Rosati, "On the decidability and complexity of query answering over inconsistent and incomplete databases," in Proc. of PODS, 2003, pp. 260-271.
39. B. Marnette and F. Geerts, "Static analysis of schema-mappings ensuring oblivious termination," in Proc. of ICDT, 2010, to appear.
40. 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.
41. J. de Bruijn and S. Heymans, "Logical foundations of (e)RDF(S): Complexity and reasoning," in Proc. of ISWC, 2007, pp. 86-99.
42. ±: A unified approach to ontologies and integrity constraints," in Proc. of ICDT, 2009, pp. 14-30.
43. A. Calì and M. Kifer, "Containment of conjunctive object meta-queries," in Proc. of VLDB, 2006, pp. 942-952.
44. M. Kifer, G. Lausen, and J. Wu, "Logical foundations of object-oriented and frame-based languages," J. ACM, vol. 42, pp. 741-843, 1995.
45. C. Gutierrez, C. Hurtado, and A. O. Mendelzon, "Foundations of semantic web databases," in Proc. of PODS, 2004.
46. R. Fagin, P. G. Kolaitis, and L. Popa, "Data exchange: getting to the core," ACM TODS, vol. 30, no. 1, pp. 174-210, 2005.
47. G. Gottlob and A. Nash, "Efficient core computation in data exchange," J. ACM, vol. 55, no. 2, 2008.
48. P. Hayes, "RDF semantics," http://www.w3.org/TR/2004/REC-rdf- mt-20040210/, 2004, W3C Recommendation.
49. F. Bry, T. Furche, C. Ley, B. Linse, and B. Marnette, "RDFLog: It's like Datalog for RDF," in Proc. of WLP, 2008.
50. F. Bry, T. Furche, B. Marnette, C. Ley, B. Linse, and O. Poppe, "SPARQLog: SPARQL with rules and quantification," in Semantic Web Information Management: A Model-Based Perspective, 2010, pp. 341-369.
51. A. Calì, G. Gottlob, and A. Pieris, "Tractable query answering over conceptual schemata," in Proc. of ER, 2009.
52. R. Rosati, "Finite model reasoning in DL-Lite," in Proc. of ESWC, 2008, pp. 215-229.
53. -, "On the finite controllability of conjunctive query answering in databases under open-world assumption," J. Comput. Syst. Sci., 2010, to appear.
54. C. Lutz, U. Sattler, and L. Tendera, "The complexity of finite model reasoning in description logics," Inform. Comput., vol. 199, no. 1-2, pp. 132-171, 2005.
55. D. Calvanese, "Finite model reasoning in description logics," in Proc. of KR, 1996, pp. 292-303.