Datalog+/-: A Family of Logical Knowledge Representation and Query Languages for New Applications

This paper summarizes results on a recently introduced family of Datalog-based languages, called Datalog+/-, which is a new framework for tractable ontology querying, and for a variety of other applications. Datalog+/- extends plain Datalog by features such as existentially quantified rule heads and, at the same time, restricts the rule syntax so as to achieve decidability and tractability. In particular, we discuss three paradigms ensuring decidability: chase termination, guardedness, and stickiness.

[1]  Ashok K. Chandra,et al.  Optimal implementation of conjunctive queries in relational data bases , 1977, STOC '77.

[2]  David Maier,et al.  Testing implications of data dependencies , 1979, SIGMOD '79.

[3]  Catriel Beeri,et al.  The Implication Problem for Data Dependencies , 1981, ICALP.

[4]  Ronald Fagin,et al.  Inclusion dependencies and their interaction with functional dependencies , 1982, PODS.

[5]  David S. Johnson,et al.  Testing containment of conjunctive queries under functional and inclusion dependencies , 1982, J. Comput. Syst. Sci..

[6]  John C. Mitchell.  The Implication Problem for Functional and Inclusion Dependencies , 1984, Inf. Control..

[7]  Matthias Jarke,et al.  Logic Programming and Databases , 1984, Expert Database Workshop.

[8]  Moshe Y. Vardi,et al.  The Implication Problem for Functional and Inclusion Dependencies is Undecidable , 1985, SIAM J. Comput..

[9]  Adrian Walker,et al.  Towards a Theory of Declarative Knowledge , 1988, Foundations of Deductive Databases and Logic Programming..

[10]  Serge Abiteboul,et al.  Foundations of Databases , 1994 .

[11]  Michael Kifer,et al.  Logical foundations of object-oriented and frame-based languages , 1995, JACM.

[12]  Moshe Y. Vardi.  On the Complexity of Bounded-Variable Queries. , 1995, PODS 1995.

[13]  Diego Calvanese,et al.  Finite Model Reasoning in Description Logics , 1996, KR.

[14]  Johan van Benthem,et al.  Modal Languages and Bounded Fragments of Predicate Logic , 1998, J. Philos. Log..

[15]  Erich Grädel,et al.  On the Restraining Power of Guards , 1999, Journal of Symbolic Logic.

[16]  Erich Grädel,et al.  Decision procedures for guarded logics , 1999 .

[17]  Erich Grädel,et al.  Invited Talk: Decision procedures for guarded logics , 1999, CADE.

[18]  Georg Gottlob,et al.  On the Complexity of Single-Rule Datalog Queries , 1999, LPAR.

[19]  Georg Gottlob,et al.  Visual Web Information Extraction with Lixto , 2001, VLDB.

[20]  Laura M. Haas,et al.  The Clio project: managing heterogeneity , 2001, SGMD.

[21]  Jean-François Baget,et al.  Extensions of Simple Conceptual Graphs: the Complexity of Rules and Constraints , 2011, J. Artif. Intell. Res..

[22]  Ulrike Sattler,et al.  The complexity of finite model reasoning in description logics , 2005, Inf. Comput..

[23]  Data exchange: getting to the core , 2003, PODS '03.

[24]  Diego Calvanese,et al.  The Description Logic Handbook: Theory, Implementation, and Applications , 2003, Description Logic Handbook.

[25]  Andrea Calì,et al.  On the decidability and complexity of query answering over inconsistent and incomplete databases , 2003, PODS.

[26]  Alin Deutsch,et al.  Reformulation of XML Queries and Constraints , 2003, ICDT.

[27]  Monadic datalog and the expressive power of languages for Web information extraction , 2004 .

[28]  Alberto O. Mendelzon,et al.  Foundations of semantic web databases , 2004, PODS.

[29]  Dan Brickley,et al.  Rdf vocabulary description language 1.0 : Rdf schema , 2004 .

[30]  Ronald Fagin,et al.  Data exchange: semantics and query answering , 2003, Theor. Comput. Sci..

[31]  Riccardo Rosati.  On the decidability and finite controllability of query processing in databases with incomplete information , 2006, PODS '06.

[32]  Elnar Hajiyev,et al.  codeQuest: Scalable Source Code Queries with Datalog , 2006, ECOOP.

[33]  Andrea Calì,et al.  Containment of conjunctive object meta-queries , 2006, VLDB.

[34]  Diego Calvanese,et al.  Tractable Reasoning and Efficient Query Answering in Description Logics: The DL-Lite Family , 2007, Journal of Automated Reasoning.

[35]  Divyakant Agrawal,et al.  Towards Scalable Architectures for Clickstream Data Warehousing , 2007, DNIS.

[36]  Jos de Bruijn,et al.  Logical Foundations of (e)RDF(S): Complexity and Reasoning , 2007, ISWC/ASWC.

[37]  Alin Deutsch,et al.  The chase revisited , 2008, PODS.

[38]  Georg Gottlob,et al.  Efficient core computation in data exchange , 2008, JACM.

[39]  Andrea Calì,et al.  Taming the Infinite Chase: Query Answering under Expressive Relational Constraints , 2008, Description Logics.

[40]  Clemens Ley.  RDFLog: It's like Datalog for RDF , 2008 .

[41]  Riccardo Rosati.  Finite Model Reasoning in DL-Lite , 2008, ESWC.

[42]  Andrea Calì,et al.  A general datalog-based framework for tractable query answering over ontologies , 2009, SEBD.

[43]  Extending Decidable Cases for Rules with Existential Variables , 2009, IJCAI.

[44]  Bruno Marnette,et al.  Generalized schema-mappings: from termination to tractability , 2009, PODS.

[45]  Tim Furche,et al.  SPARQLog: SPARQL with Rules and Quantification , 2009, Semantic Web Information Management.

[46]  Georg Gottlob,et al.  Datalog±: a unified approach to ontologies and integrity constraints , 2009, ICDT '09.

[47]  Georg Lausen,et al.  On Chase Termination Beyond Stratification , 2009, Proc. VLDB Endow..

[48]  Letizia Tanca,et al.  Semantic Web Information Management - A Model-Based Perspective , 2009, Semantic Web Information Management.

[49]  Andrea Calì,et al.  Tractable Query Answering over Conceptual Schemata , 2009, ER.

[50]  Andrea Calì,et al.  Advanced processing for ontological queries , 2010, Proc. VLDB Endow..

[51]  Floris Geerts,et al.  Static analysis of schema-mappings ensuring oblivious termination , 2010, ICDT '10.

[52]  Georg Gottlob,et al.  Querying the Guarded Fragment , 2010, 2010 25th Annual IEEE Symposium on Logic in Computer Science.

[53]  Riccardo Rosati.  On the finite controllability of conjunctive query answering in databases under open-world assumption , 2011, J. Comput. Syst. Sci..