Datalog and Logic Databases

Abstract The use of logic in databases started in the late 1960s. In the early 1970s Codd formalized databases in terms of the relational calculus and the relational algebra. A major influence on the use of logic in databases was the development of the field of logic programming. Logic provides a convenient formalism for studying classical database problems and has the important property of being declarative, that is, it allows one to express what she wants rather than how to get it. For a long time, relational calculus and algebra were considered the relational database languages. However, there are simple operations, such as computing the transitive closure of a graph, which cannot be expressed with these languages. Datalog is a declarative query language for relational databases based on the logic programming paradigm. One of the peculiarities that distinguishes Datalog from query languages like relational algebra and calculus is recursion, which gives Datalog the capability to express queries like com...

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

[2]  Jeffrey F. Naughton,et al.  Efficient evaluation of right-, left-, and multi-linear rules , 1989, SIGMOD '89.

[3]  Clement T. Yu,et al.  Linearization of Nonlinear Recursive Rules , 1989, IEEE Trans. Software Eng..

[4]  Carlo Zaniolo,et al.  The Generalized Counting Method for Recursive Logic Queries , 1986, ICDT.

[5]  Allen Van Gelder,et al.  Foundations of Aggregation in Deductive Databases , 1993, DOOD.

[6]  Sergio Greco,et al.  Minimum and maximum predicates in logic programming , 1991, PODS '91.

[7]  Letizia Tanca,et al.  Logic Programming and Databases , 1990, Surveys in Computer Science.

[8]  Kotagiri Ramamohanarao,et al.  A Generalization of the Differential Approach to Recursive Query Evaluation , 1987, J. Log. Program..

[9]  Jack Minker,et al.  Overview of disjunctive logic programming , 1994, Annals of Mathematics and Artificial Intelligence.

[10]  Letizia Tanca,et al.  What you Always Wanted to Know About Datalog (And Never Dared to Ask) , 1989, IEEE Trans. Knowl. Data Eng..

[11]  Jeffrey D. Ullman,et al.  Induction variables in very high level languages , 1976, POPL.

[12]  Foto N. Afrati,et al.  Expressiveness of restricted recursive queries , 1989, STOC '89.

[13]  Sergio Greco,et al.  Checking Chase Termination: Cyclicity Analysis and Rewriting Techniques , 2015, IEEE Transactions on Knowledge and Data Engineering.

[14]  Sergio Greco,et al.  Grammars and Automata to Optimize Chain Logic Queries , 1999, Int. J. Found. Comput. Sci..

[15]  Hans Zantema,et al.  Termination of Term Rewriting: Interpretation and Type Elimination , 1994, J. Symb. Comput..

[16]  Hans Zantema,et al.  Matrix Interpretations for Proving Termination of Term Rewriting , 2006, Journal of Automated Reasoning.

[17]  Wolfgang Faber,et al.  Semantics and complexity of recursive aggregates in answer set programming , 2011, Artif. Intell..

[18]  Ion Stoica,et al.  Declarative routing: extensible routing with declarative queries , 2005, SIGCOMM '05.

[19]  Kenneth A. Ross,et al.  Monotonic Aggregation in Deductive Database , 1997, J. Comput. Syst. Sci..

[20]  Thomas Eiter,et al.  Expressive Power and Complexity of Partial Models for Disjunctive Deductive Databases , 1998, Theor. Comput. Sci..

[21]  Sergio Greco,et al.  Incomplete Data and Data Dependencies in Relational Databases , 2012, Incomplete Data and Data Dependencies in Relational Databases.

[22]  Robert A. Kowalski,et al.  Predicate Logic as Programming Language , 1974, IFIP Congress.

[23]  J. A. Robinson,et al.  A Machine-Oriented Logic Based on the Resolution Principle , 1965, JACM.

[24]  Monica S. Lam,et al.  SociaLite: Datalog extensions for efficient social network analysis , 2013, 2013 IEEE 29th International Conference on Data Engineering (ICDE).

[25]  Mario Alviano,et al.  Disjunctive ASP with functions: Decidable queries and effective computation , 2010, Theory Pract. Log. Program..

[26]  Marco Calautti,et al.  Using linear constraints for logic program termination analysis , 2015, Theory and Practice of Logic Programming.

[27]  Domenico Saccà,et al.  Comparison of Methods for Logic-Query Implementation , 1991, J. Log. Program..

[28]  Joseph M. Hellerstein,et al.  Boom analytics: exploring data-centric, declarative programming for the cloud , 2010, EuroSys '10.

[29]  David Maier,et al.  Review of "Introduction to automata theory, languages and computation" by John E. Hopcroft and Jeffrey D. Ullman. Addison-Wesley 1979. , 1980, SIGA.

[30]  Catriel Beeri,et al.  On the power of magic , 1987, PODS '87.

[31]  Jeffrey F. Naughton,et al.  A Counting Algorithm for a Cyclic Binary Query , 1991, J. Comput. Syst. Sci..

[32]  Peter J. Stuckey,et al.  Testing for Termination with Monotonicity Constraints , 2005, ICLP.

[33]  Phokion G. Kolaitis.  The Expressive Power of Stratified Programs , 1991, Inf. Comput..

[34]  Sergio Greco,et al.  Stratification criteria and rewriting techniques for checking chase termination , 2011, Proc. VLDB Endow..

[35]  Sergio Greco,et al.  Chase termination , 2010, Proc. VLDB Endow..

[36]  E. F. Codd,et al.  A relational model of data for large shared data banks , 1970, CACM.

[37]  Hamid Pirahesh,et al.  The Magic of Duplicates and Aggregates , 1990, VLDB.

[38]  Luigi Palopoli,et al.  Testing Logic Programs for Local Stratification , 1992, Theor. Comput. Sci..

[39]  Shamim A. Naqvi,et al.  A Logical Language for Data and Knowledge Bases , 1989 .

[40]  Sergio Greco,et al.  Greedy by choice , 1992, PODS '92.

[41]  Enno Ohlebusch,et al.  Termination of Logic Programs: Transformational Methods Revisited , 2001, Applicable Algebra in Engineering, Communication and Computing.

[42]  Boris Motik,et al.  Acyclicity Notions for Existential Rules and Their Application to Query Answering in Ontologies , 2013, J. Artif. Intell. Res..

[43]  Sergio Greco,et al.  Optimization of Logic Queries with MIN and MAX Predicates , 1998, FQAS.

[44]  Dino Pedreschi,et al.  Datalog with Non-Deterministic Choice Computers NDB-PTIME , 1998, J. Log. Program..

[45]  Wolfgang Faber,et al.  The DLV system for knowledge representation and reasoning , 2002, TOCL.

[46]  Laurent Vieille,et al.  Recursive Query Processing: The Power of Logic , 1989, Theor. Comput. Sci..

[47]  Yatin P. Saraiya.  Linearising nonlinear recursions in polynomial time , 1989, PODS.

[48]  Germán Vidal,et al.  Termination of narrowing via termination of rewriting , 2010, Applicable Algebra in Engineering, Communication and Computing.

[49]  David Harel,et al.  Horn Clauses Queries and Generalizations , 1985, J. Log. Program..

[50]  Jürgen Giesl,et al.  Automated termination proofs for logic programs by term rewriting , 2008, TOCL.

[51]  Jeffrey D. Ullman,et al.  Principles Of Database And Knowledge-Base Systems , 1979 .

[52]  Carlo Zaniolo,et al.  Deterministic and Non-Deterministic Stable Models , 1997, J. Log. Comput..

[53]  Sushil Jajodia,et al.  A Logic Framework for Flexible and Security-Aware Service Composition , 2013, 2013 IEEE 10th International Conference on Ubiquitous Intelligence and Computing and 2013 IEEE 10th International Conference on Autonomic and Trusted Computing.

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

[55]  Aart Middeldorp,et al.  Root-Labeling , 2008, RTA.

[56]  Jack Minker,et al.  Logic and Databases: A Deductive Approach , 1984, CSUR.

[57]  Peter J. Stuckey,et al.  Semantics of Logic Programs with Aggregates , 1991, ISLP.

[58]  Hans Zantema,et al.  Termination of Term Rewriting by Semantic Labelling , 1995, Fundam. Informaticae.

[59]  Sergio Greco,et al.  Optimization of Linear Logic Programs Using Counting Methods , 1992, EDBT.

[60]  Alfred V. Aho,et al.  Universality of data retrieval languages , 1979, POPL.

[61]  J. T. Schwartz,et al.  Expression continuity and the formal differentiation of algorithms , 1977, POPL 1977.

[62]  Carlo Zaniolo,et al.  Stable models and non-determinism in logic programs with negation , 1990, PODS.

[63]  Sergio Greco,et al.  Dynamic Programming in Datalog with Aggregates , 1999, IEEE Trans. Knowl. Data Eng..

[64]  Sergio Greco,et al.  Complexity and Expressive Power of Deterministic Semantics for DATALOG¬ , 1999, Inf. Comput..

[65]  Carlo Zaniolo,et al.  Logic and Databases: A History of Deductive Databases , 2014, Computational Logic.

[66]  Marco Calautti,et al.  Logic Program Termination Analysis Using Atom Sizes , 2015, IJCAI.

[67]  Sergio Greco,et al.  Extending stratified datalog to capture complexity classes ranging from ${\cal P} to {\cal QH}$ , 2001, Acta Informatica.

[68]  Christos H. Papadimitriou,et al.  Why not negation by fixpoint? , 1988, PODS '88.

[69]  Kotagiri Ramamohanarao,et al.  Efficient Recursive Aggregation and Negation in Deductive Databases , 1998, IEEE Trans. Knowl. Data Eng..

[70]  R. Ramakrishnan,et al.  A framework for testing safety and effective computability of extended datalog , 1988, SIGMOD '88.

[71]  Sergio Greco,et al.  The Expressive Power of "Possible-is-Certain" Semantics (Extended Abstract) , 1996, ASIAN.

[72]  Johannes Gehrke,et al.  Database management systems (3. ed.) , 2003 .

[73]  Giovambattista Ianni,et al.  Enhancing ASP by Functions: Decidable Classes and Implementation Techniques , 2010, AAAI.

[74]  Oded Shmueli,et al.  How expressive is stratified aggregation? , 2005, Annals of Mathematics and Artificial Intelligence.

[75]  Krzysztof R. Apt,et al.  Contributions to the Theory of Logic Programming , 1982, JACM.

[76]  Kenneth Steiglitz,et al.  Combinatorial Optimization: Algorithms and Complexity , 1981 .

[77]  Georg Gottlob,et al.  Complexity and expressive power of logic programming , 2001, CSUR.

[78]  Martin Gebser,et al.  GrinGo : A New Grounder for Answer Set Programming , 2007, LPNMR.

[79]  Sergio Greco,et al.  Binding Propagation in Disjunctive Databases , 1998, VLDB.

[80]  Martin Gebser,et al.  Conflict-driven answer set solving: From theory to practice , 2012, Artif. Intell..

[81]  Howard A. Blair,et al.  The Complexity of Local Stratification , 1994, Fundam. Informaticae.

[82]  Jeffrey D. Ullman.  The Interface Between Language Theory and Database Theory , 1992, Theoretical Studies in Computer Science.

[83]  Danny De Schreye,et al.  Non-termination analysis of logic programs with integer arithmetics , 2011, Theory Pract. Log. Program..

[84]  Robert A. Kowalski,et al.  Logic for problem solving , 1982, The computer science library : Artificial intelligence series.

[85]  Allen Van Gelder,et al.  The well-founded semantics of aggregation , 1992, PODS.

[86]  Danny De Schreye,et al.  Termination proofs for logic programs with tabling , 2001, TOCL.

[87]  Mario Alviano,et al.  Magic Sets for disjunctive Datalog programs , 2012, Artif. Intell..

[88]  Mihalis Yannakakis,et al.  Graph-theoretic methods in database theory , 1990, PODS.

[89]  Shamim A. Naqvi,et al.  Non-Deterministic Choice in Datalog , 1988, JCDKB.

[90]  Teodor C. Przymusinski.  Stable semantics for disjunctive programs , 1991, New Generation Computing.

[91]  Jürgen Giesl,et al.  Termination Analysis of Logic Programs Based on Dependency Graphs , 2007, LOPSTR.

[92]  Sergio Greco,et al.  DATALOG Queries with Stratified Negation and Choice: from P to DP , 1995, ICDT.

[93]  Jacob T. Schwartz,et al.  Reduction in Strength of High Level Operations , 1977, POPL.

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

[95]  Sergio Greco,et al.  Logic programming with function symbols: Checking termination of bottom-up evaluation through program adornments , 2013, Theory and Practice of Logic Programming.

[96]  Shan Shan Huang,et al.  Datalog and Recursive Query Processing , 2013, Found. Trends Databases.

[97]  Serge Abiteboul,et al.  Diagnosis of asynchronous discrete event systems: datalog to the rescue! , 2005, PODS.

[98]  Piero A. Bonatti,et al.  On Finitely Recursive Programs , 2007, ICLP.

[99]  Carlo Zaniolo,et al.  A declarative extension of horn clauses, and its significance for datalog and its applications , 2013, Theory and Practice of Logic Programming.

[100]  Micah Sherr,et al.  SecureBlox: customizable secure distributed data processing , 2010, SIGMOD Conference.

[101]  John P. Gallagher,et al.  Termination analysis of logic programs through combination of type-based norms , 2007, TOPL.

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

[103]  Martín Abadi,et al.  Unified Declarative Platform for Secure Netwoked Information Systems , 2009, 2009 IEEE 25th International Conference on Data Engineering.

[104]  E. F. Codd,et al.  Relational Completeness of Data Base Sublanguages , 1972, Research Report / RJ / IBM / San Jose, California.

[105]  Yufei Tao,et al.  Indexing uncertain data , 2009, PODS.

[106]  Sergio Greco,et al.  Binding Propagation Techniques for the Optimization of Bound Disjunctive Queries , 2003, IEEE Trans. Knowl. Data Eng..

[107]  Jeffrey D. Ullman,et al.  Parallel complexity of logical query programs , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[108]  David Maier,et al.  The Theory of Relational Databases , 1983 .

[109]  Jeffrey D. Ullman,et al.  Proof-tree transformation theorems and their applications , 1989, PODS.

[110]  Sergio Greco,et al.  Efficient Execution of Recursive Queries Through Controlled Binding Propagation , 1994, ISMIS.

[111]  Thomas Eiter,et al.  On the partial semantics for disjunctive deductive databases , 2004, Annals of Mathematics and Artificial Intelligence.

[112]  Andreas Behrend,et al.  Soft stratification for magic set based query evaluation in deductive databases , 2003, PODS.

[113]  Alan van Gelser.  Negation as failure using tight derivations for general logic programs , 1989 .

[114]  Robert A. Kowalski,et al.  The Semantics of Predicate Logic as a Programming Language , 1976, JACM.

[115]  Domenico Saccà,et al.  The Expressive Powers of Stable Models for Bound and Unbound DATALOG Queries , 1997, J. Comput. Syst. Sci..

[116]  Carlo Zaniolo,et al.  Non-Determinism in Deductive Databases , 1991, DOOD.

[117]  Richard Hull,et al.  Positivism vs minimalism in deductive databases , 1985, PODS '86.

[118]  Adrian Onet,et al.  The Chase Procedure and its Applications in Data Exchange , 2013, Data Exchange, Information, and Streams.

[119]  Jorge Lobo,et al.  Foundations of disjunctive logic programming , 1992, Logic Programming.

[120]  Piero A. Bonatti,et al.  Reasoning with infinite stable models , 2001, Artif. Intell..

[121]  Shan Shan Huang,et al.  Datalog and emerging applications: an interactive tutorial , 2011, SIGMOD '11.

[122]  Carlo Zaniolo,et al.  Optimizing recursive queries with monotonic aggregates in DeALS , 2015, 2015 IEEE 31st International Conference on Data Engineering.

[123]  Sergio Greco,et al.  Bounded Programs: A New Decidable Class of Logic Programs with Function Symbols , 2013, IJCAI.

[124]  Yannis E. Ioannidis.  Commutativity and its Role in the Processing of Linear Recursion , 1992, J. Log. Program..

[125]  Michael Meier,et al.  On the Termination of the Chase Algorithm , 2010, RR.

[126]  Jeffrey D. Ullman,et al.  Principles of Database and Knowledge-Base Systems, Volume II , 1988, Principles of computer science series.

[127]  Marco Calautti,et al.  Checking Termination of Bottom-Up Evaluation of Logic Programs with Function Symbols , 2015, Theory Pract. Log. Program..

[128]  Maurice Bruynooghe,et al.  Well-founded and stable semantics of logic programs with aggregates , 2007, Theory Pract. Log. Program..

[129]  Abraham Silberschatz,et al.  Database System Concepts , 1980 .

[130]  Sergio Greco,et al.  Non-determinism and weak constraints in Datalog , 1998, New Generation Computing.

[131]  Foto N. Afrati,et al.  Expressiveness of Restricted Recursive Queries (Extended Abstract) , 1989, STOC 1989.

[132]  Carlo Zaniolo,et al.  On the implementation of a simple class of logic queries for databases , 1985, PODS.

[133]  Sebastian Rudolph,et al.  Extending Decidable Existential Rules by Joining Acyclicity and Guardedness , 2011, IJCAI.

[134]  S. Sudarshan,et al.  Aggregation and Relevance in Deductive Databases , 1991, VLDB.

[135]  Divesh Srivastava,et al.  CORAL - Control, Relations and Logic , 1992, VLDB.

[136]  C. J. Date.  An introduction to database systems (7. ed.) , 1999 .

[137]  Ion Stoica,et al.  Declarative networking: language, execution and optimization , 2006, SIGMOD Conference.

[138]  David Maier,et al.  Magic sets and other strange ways to implement logic programs (extended abstract) , 1985, PODS '86.

[139]  Sergio Greco,et al.  Optimization of Disjunctive Queries , 1999, International Conference on Logic Programming.

[140]  Carlo Zaniolo,et al.  Magic counting methods , 1987, SIGMOD '87.

[141]  Massimo Marchiori.  Proving Existential Termination of Normal Logic Programs , 1996, AMAST.

[142]  Kenneth A. Ross,et al.  The well-founded semantics for general logic programs , 1991, JACM.

[143]  Bernard Lang,et al.  Datalog Automata , 1988, JCDKB.

[144]  Sergey M. Dudakov.  On the Complexity of Perfect Models of Logic Programs , 1999, Fundam. Informaticae.

[145]  Carlo Zaniolo,et al.  Semantics and Expressive Power of Nondeterministic Constructs in Deductive Databases , 2001, J. Comput. Syst. Sci..

[146]  Raghu Ramakrishnan,et al.  Database Management Systems , 1976 .

[147]  Jack Minker,et al.  Disjunctive Logic Programming: A Survey and Assessment , 2002, Computational Logic: Logic Programming and Beyond.

[148]  Raghu Ramakrishnan,et al.  Performance Evaluation of Data Intensive Logic Programs , 1988, Foundations of Deductive Databases and Logic Programming..

[149]  L. Vielle,et al.  Recursive query processing: the power of logic , 1989 .

[150]  Vladimir Lifschitz,et al.  On the Declarative Semantics of Logic Programs with Negation , 1987, Foundations of Deductive Databases and Logic Programming..

[151]  Guido Moerkotte,et al.  Optimization and Evaluation of Disjunctive Queries , 2000, IEEE Trans. Knowl. Data Eng..

[152]  Piero A. Bonatti,et al.  On finitely recursive programs1 , 2009, Theory and Practice of Logic Programming.

[153]  Marco Calautti,et al.  Checking Termination of Datalog with Function Symbols Through Linear Constraints , 2015, SEBD.

[154]  Georg Gottlob,et al.  Disjunctive datalog , 1997, TODS.

[155]  Teodor C. Przymusinski.  On the Declarative Semantics of Deductive Databases and Logic Programs , 1988, Foundations of Deductive Databases and Logic Programming..

[156]  Cristian Molinaro,et al.  Integrating and Querying P2P Deductive Databases , 2006, 2006 10th International Database Engineering and Applications Symposium (IDEAS'06).

[157]  Alberto O. Mendelzon,et al.  Low Complexity Aggregation in GraphLog and Datalog , 1993, Theor. Comput. Sci..

[158]  David H. D. Warren,et al.  Definite Clause Grammars for Language Analysis - A Survey of the Formalism and a Comparison with Augmented Transition Networks , 1980, Artif. Intell..

[159]  Michael J. Maher,et al.  Foundations of Deductive Databases and Logic Programming , 1988 .

[160]  Yehoshua Sagiv,et al.  Safety of datalog queries over infinite databases , 1989, PODS '89.

[161]  Eugene Wong,et al.  Transforming Nonlinear Recursion into Linear Recursion , 1988, Expert Database Conf..

[162]  Yannis Smaragdakis,et al.  Strictly declarative specification of sophisticated points-to analyses , 2009, OOPSLA.

[163]  Kenneth A. Ross,et al.  Unfounded sets and well-founded semantics for general logic programs , 1988, PODS.

[164]  Tommi Syrjänen.  Omega-Restricted Logic Programs , 2001, LPNMR.

[165]  Sergio Greco,et al.  Deterministic Semantics for Datalog¬: Complexity and Expressive Power , 1997, DOOD.

[166]  Serge Abiteboul,et al.  A rule-based language for web data management , 2011, PODS.

[167]  Mihalis Yannakakis,et al.  On Datalog vs. Polynomial Time , 1995, J. Comput. Syst. Sci..

[168]  Sergio Greco,et al.  A three-valued semantics for querying and repairing inconsistent databases , 2007, Annals of Mathematics and Artificial Intelligence.

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

[170]  Timo Soininen,et al.  Extending and implementing the stable model semantics , 2000, Artif. Intell..

[171]  Sergio Greco,et al.  Greedy Algorithms in Datalog with Choice and Negation , 1998, IJCSLP.

[172]  Carlo Zaniolo,et al.  Partial Models and Three-Valued Models in Logic Programs with Negation , 1991, LPNMR.

[173]  Catriel Beeri,et al.  Bounds on the Propagation of Selection into Logic Programs , 1990, J. Comput. Syst. Sci..

[174]  Kenneth A. Ross,et al.  Efficient Incremental Evaluation of Queries with Aggregation , 1994, ILPS.

[175]  Carlo Zaniolo,et al.  Safety and Compilation of Non-recursive Horn Clauses , 1986, Expert Database Conf..

[176]  Sergio Greco,et al.  Optimization of bound disjunctive queries with constraints , 2004, Theory and Practice of Logic Programming.

[177]  Wolfgang Faber,et al.  Magic Sets and their application to data integration , 2007, J. Comput. Syst. Sci..

[178]  Jeffrey F. Naughton,et al.  Declarative Information Extraction Using Datalog with Embedded Extraction Predicates , 2007, VLDB.

[179]  Teodor C. Przymusinski.  On the declarative and procedural semantics of logic programs , 1989, Journal of Automated Reasoning.

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

[181]  Sergio Greco,et al.  The Expressive Power of Unique Total Stable Model Semantics , 1997, ICALP.

[182]  Kenneth A. Ross,et al.  Modular stratification and magic sets for Datalog programs with negation , 1994, JACM.

[183]  Abraham Silberschatz,et al.  An axiomatic approach to deciding query safety in deductive databases , 1988, PODS '88.

[184]  Kotagiri Ramamohanarao,et al.  Efficient Bottom-UP Computation of Queries on Stratified Databases , 1991, J. Log. Program..

[185]  J. W. Lloyd,et al.  Foundations of logic programming; (2nd extended ed.) , 1987 .

[186]  Jürgen Giesl,et al.  Termination of term rewriting using dependency pairs , 2000, Theor. Comput. Sci..

[187]  Yuliya Lierler,et al.  One More Decidable Class of Finitely Ground Programs , 2009, ICLP.

[188]  David S. Johnson,et al.  A Catalog of Complexity Classes , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.

[189]  Michael Gelfond,et al.  Classical negation in logic programs and disjunctive databases , 1991, New Generation Computing.

[190]  Domenico Saccà.  Deterministic and Non-Deterministic Stable Model Semantics for Unbound DATALOG Queries , 1995, ICDT.

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

[192]  Serge Abiteboul,et al.  Datalog Extensions for Database Queries and Updates , 1991, J. Comput. Syst. Sci..

[193]  Li-Yan Yuan,et al.  On the Equivalence of Semantics for Normal Logic Programs , 1995, J. Log. Program..

[194]  Teodor C. Przymusinski,et al.  Weakly Perfect Model Semantics for Logic Programs , 1988, ICLP/SLP.

[195]  Hans Zantema,et al.  Total termination of term rewriting , 1993, Applicable Algebra in Engineering, Communication and Computing.

[196]  Jeffrey F. Naughton,et al.  Argument Reduction by Factoring , 1989, VLDB.

[197]  Georg Gottlob,et al.  The Lixto data extraction project: back and forth between theory and practice , 2004, PODS.

[198]  Sergio Greco,et al.  atalog: A logic language for expressing search and optimization problems , 2009, Theory and Practice of Logic Programming.

[199]  Suzanne W. Dietrich,et al.  Shortest path by approximation in logic programs , 1992, LOPL.

[200]  Mario Alviano,et al.  Unfounded Sets and Well-Founded Semantics of Answer Set Programs with Aggregates , 2011, J. Artif. Intell. Res..

[201]  Fabrizio Riguzzi,et al.  Terminating Evaluation of Logic Programs with Finite Three-Valued Models , 2014, TOCL.

[202]  Jürgen Giesl,et al.  The Dependency Triple Framework for Termination of Logic Programs , 2009, LOPSTR.

[203]  David Harel,et al.  Structure and complexity of relational queries , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

[204]  Sergio Greco,et al.  On the Termination of Logic Programs with Function Symbols , 2012, ICLP.

[205]  Phokion G. Kolaitis,et al.  On the Expressive Power of Datalog: Tools and a Case Study , 1995, J. Comput. Syst. Sci..

[206]  Sergio Greco,et al.  ``Possible is certain'' is desirable and can be expressive , 2004, Annals of Mathematics and Artificial Intelligence.

[207]  Emir Pasalic,et al.  Design and Implementation of the LogicBlox System , 2015, SIGMOD Conference.

[208]  Francesco Buccafurri,et al.  Enhancing Disjunctive Datalog by Constraints , 2000, IEEE Trans. Knowl. Data Eng..

[209]  Marco Calautti,et al.  Checking Termination of Logic Programs with Function Symbols through Linear Constraints , 2014, RuleML.

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

[211]  Mauricio Osorio,et al.  Aggregation and negation-as-failure , 2009, New Generation Computing.

[212]  Wolfgang Faber,et al.  Enhancing the Magic-Set Method for Disjunctive Datalog Programs , 2004, ICLP.

[213]  Christos H. Papadimitriou,et al.  The parallel complexity of simple chain queries , 1987, PODS '87.

[214]  John S. Schlipf,et al.  The Expressive Powers of the Logic Programming Semantics , 1995, J. Comput. Syst. Sci..

[215]  Abraham Silberschatz,et al.  Safety of recursive Horn clauses with infinite relations , 1987, PODS '87.

[216]  Jürgen Giesl,et al.  Automated termination analysis for logic programs with cut , 2010, Theory Pract. Log. Program..

[217]  Marco Calautti,et al.  Detecting decidable classes of finitely ground logic programs with function symbols , 2013, PPDP.

[218]  Sergio Greco,et al.  Greedy Algorithms in Datalog , 2001, Theory Pract. Log. Program..

[219]  Maurizio Lenzerini,et al.  Data integration: a theoretical perspective , 2002, PODS.

[220]  Sergio Greco,et al.  Implementation and Experimentation of the Logic Language NP Datalog , 2006, DEXA.

[221]  Peter T. Wood,et al.  Factoring Augmented Regular Chain Programs , 1990, VLDB.

[222]  Sergio Greco,et al.  Extending Datalog with Choice and Weak Constraints , 1996, APPIA-GULP-PRODE.

[223]  Ion Stoica,et al.  Implementing declarative overlays , 2005, SOSP '05.

[224]  John DeTreville,et al.  Binder, a logic-based security language , 2002, Proceedings 2002 IEEE Symposium on Security and Privacy.

[225]  Victor W. Marek,et al.  Autoepistemic logic , 1991, JACM.