chapter

Datalog: concepts, history, and outlook

Authors:

K. Tuncay Tekle,

David S. WarrenAuthors Info & Claims

Declarative Logic Programming: Theory, Systems, and Applications

September 2018

Pages 3 - 100

https://doi.org/10.1145/3191315.3191317

Published: 01 September 2018 Publication History

Abstract

This chapter is a survey of the history and the main concepts of Datalog.We begin with an introduction to the language and its use for database definition and querying. We then look back at the threads from logic languages, databases, artificial intelligence, and expert systems that led to the emergence of Datalog and reminiscence about the origin of the name. We consider the interaction of recursion with other common data language features, such as negation and aggregation, and look at other extensions, such as constraints, updates, and object-oriented features.We provide an overview of the main approaches to Datalog evaluation and their variants, then recount some early implementations of Datalog and of similar deductive database systems.We speculate on the reasons for the decline in the interest in the language in the 1990s and the causes for its later resurgence in a number of application areas.We conclude with several examples of current systems based on or supporting Datalog and briefly examine the performance of some of them.

References

[1]

S. Abiteboul and C. Beeri. Oct. 1995. The power of languages for the manipulation of complex values. The VLDB Journal, 4(4):727--794. 34

Digital Library

[2]

S. Abiteboul and S. Grumbach. Sept. 1987. COL: A logic-based language for complex objects. In Advanced in Database Programming Languages: Proc. of the Workshop on Database Programming Languages, pp. 253--276. 33

Digital Library

[3]

S. Abiteboul and P. C. Kanellakis. May/Jun. 1989. Object identity as a query language primitive. In ACM SIGMOD Conference on Management of Data, pp. 159--173.

Digital Library

[4]

S. Abiteboul and V. Vianu. 1990. Procedural languages for database queries and updates. Journal of Computer and System Sciences, 41(2):181--229. 43

Digital Library

[5]

S. Abiteboul, R. Hull, and V. Vianu. 1995. Foundations of Databases. Addison-Wesley. 76

Digital Library

[6]

S. Abiteboul, P. Buneman, and D. Suciu. 2000. Data on the Web: From Relations to Semistructured Data and XML. Morgan Kaufmann, San Francisco, CA. 34, 36

Digital Library

[7]

S. Abiteboul, Z. Abrams, S. Haar, and T. Milo. 2005. Diagnosis of asynchronous discrete event systems: Datalog to the rescue! In Proc. of the Twenty-fourth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS '05, pp. 358--367. ACM. 82

Digital Library

[8]

S. Abiteboul, M. Bienvenu, A. Galland, and E. Antoine. 2011. A rule-based language for web data management. In Proc. of the Thirtieth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS '11, pp. 293--304. ACM. 84

Digital Library

[9]

F. Afrati and S. S. Cosmadakis. 1989. Expressiveness of restricted recursive queries. In Proc. of the Twenty-first Annual ACM Symposium on Theory of Computing, STOC '89, pp. 113--126. ACM. 77

Digital Library

[10]

F. Afrati, C. H. Papadimitriou, G. Papageorgiou, A. Roussou, Y. Sagiv, and J. D. Ullman. 1986. Convergence of sideways query evaluation. In ACM Symposium on Principles of Database Systems, pp. 24--30.

Digital Library

[11]

R. Agrawal, R. Cochrane, and B. Lindsay. 1991. On maintaining priorities in a production rule system. In International Conference on Very Large Data Bases, pp. 479--487. Morgan Kaufmann, San Francisco, CA. 42

Digital Library

[12]

A. V. Aho and J. D. Ullman. 1979. Universality of data retrieval languages. In Proc. of the 6th ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages, POPL '79, pp. 110--119. ACM. 13, 50, 77

Digital Library

[13]

H. Aït-Kaci and R. Nasr. 1986. LOGIN: A logic programming language with built-in inheritance. Journal of Logic Programming, 3: 185--215. 33, 34

Digital Library

[14]

H. Aït-Kaci and A. Podelski. Aug. 1993. Towards a meaning of LIFE. Journal of Logic Programming, 16: 195--234. 33, 34

[15]

J. J. Alferes, A. Brogi, J. A. Leite, and L. M. Pereira. Sept. 2002. Evolving logic programs. In Proc. of Logics in Artificial Intelligence: 8th European Conference, pp. 50--62. Springer, Berlin, Heidelberg. 43

Digital Library

[16]

M. Alviano, N. Leone, M. Manna, G. Terracina, and P. Veltri. 2012. Magic-sets for Datalog with existential quantifiers. In Proc. of the Second International Workshop on Datalog in Academia and Industry: Datalog 2.0, pp. 31--43. Springer, Berlin, Heidelberg. 28

Digital Library

[17]

J. Anderson, M. Gaare, J. Holguín, N. Bailey, and T. Pratley. 2016. The Datomic database. In Professional Clojure, pp. 169--215. Wiley Online Library. 88

[18]

R. Angles and C. Gutierrez. 2008. The expressive power of SPARQL. In Proc. of the 7th International Conference on The Semantic Web, ISWC '08, pp. 114--129. Springer-Verlag, Berlin, Heidelberg. 76

Digital Library

[19]

K. R. Apt, H. A. Blair, and A. Walker. 1988. Towards a theory of declarative knowledge. In J. Minker, editor, Foundations of Deductive Databases and Logic Programming, pp. 89--148. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA. 19

Digital Library

[20]

M. Aref, B. ten Cate, T. J. Green, B. Kimelfeld, D. Olteanu, E. Pasalic, T. L. Veldhuizen, and G. Washburn. 2015. Design and implementation of the LogicBlox system. In Proc. of the 2015 ACM SIGMOD International Conference on Management of Data, SIGMOD '15, pp. 1371--1382. ACM. 28, 29, 87

Digital Library

[21]

F. Arni, K. Ong, S. Tsur, H. Wang, and C. Zaniolo. Jan. 2003. The deductive database system LDL++. Theory and Practice of Logic Programming, 3(1):61--94.

Digital Library

[22]

M. P. Ashley-Rollman, S. C. Goldstein, P. Lee, T. C. Mowry, and P. Pillai. Oct. 2007. Meld: A declarative approach to programming ensembles. In 2007 IEEE/RSJ International Conference on Intelligent Robots and Systems, pp. 2794--2800. 83

[23]

F. Baader, D. Calvanese, D. L. McGuinness, D. Nardi, and P. F. Patel-Schneider, editors. 2003. The Description Logic Handbook: Theory, Implementation, and Applications. Cambridge University Press, New York. 64, 78

Digital Library

[24]

F. Bancilhon. Sept. 1978. On the completeness of query languages for relational data bases. In Proc. of the 7th Symposium on Mathematical Foundations of Computer Science, pp. 112--123. 13

[25]

F. Bancilhon and S. N. Khoshafian. Apr. 1989. A calculus for complex objects. Journal of Computer and System Sciences, 38(2):326--340. 34

[26]

F. Bancilhon and R. Ramakrishnan. 1986. An amateur's introduction to recursive query processing strategies. In Proc. of the 1986 ACM SIGMOD International Conference on Management of Data, SIGMOD '86, pp. 16--52. ACM. 48, 60, 61

Digital Library

[27]

F. Bancilhon, D. Maier, Y. Sagiv, and J. D. Ullman. 1986. Magic sets and other strange ways to implement logic programs. In ACM Symposium on Principles of Database Systems, pp. 1--15. 16, 50, 51, 93

Digital Library

[28]

R. Basseda and M. Kifer. June 2015a. State space planning using Transaction Logic. In International Symposium on Practical Aspects of Declarative Languages (PADL 2015), pp. 17--33. 46

Digital Library

[29]

R. Basseda and M. Kifer. Aug. 2015b. Planning with regression analysis in Transaction Logic. In Web Reasoning and Rule Systems, 9th International Conference (RR 2015), pp. 45--60. 46

[30]

R. Basseda, M. Kifer, and A. J. Bonner. Sept. 2014. Planning with Transaction Logic. In 8th International Conference on Web Reasoning and Rule Systems, (RR 2014), vol. 8741 of Lecture Notes in Computer Science, pp. 29--44. Springer. 46

[31]

M. Y. Becker and P. Sewell. 2004. Cassandra: Distributed access control policies with tunable expressiveness. In Proc. of the Fifth IEEE International Workshop on Policies for Distributed Systems and Networks, POLICY '04, pp. 159--168. IEEE Computer Society. 82

Digital Library

[32]

C. Beeri. 1989. Formal models for object-oriented databases. In International Conference on Deductive and Object-Oriented Databases, pp. 370--395. Elsevier Science Publishers. 34

[33]

C. Beeri and R. Ramakrishnan. 1991. On the power of magic. Journal of Logic Programming, 10(3&4):255--299. 51

Digital Library

[34]

C. Beeri and M. Y. Vardi. 1981. The implication problem for data dependencies. In S. Even and O. Kariv, editors, Automata, Languages and Programming: Eighth Colloquium, pp. 73--85. Springer, Berlin, Heidelberg. 26

Digital Library

[35]

C. Beeri, R. Nasr, and S. Tsur. 1988. Embedding ψ-terms in a horn-clause logic language. In Third International Conference on Data and Knowledge Bases: Improving Usability and Responsiveness, pp. 347--359. Morgan Kaufmann. 50033-0. 33

[36]

C. Beeri, S. Naqvi, O. Shmueli, and S. Tsur. Apr. 1991. Set constructors in a logic database language. Journal of Logic Programming, 10: 181--232. 33

Digital Library

[37]

T. Berners-Lee, J. Handler, and O. Lassila. May 2001. The Semantic Web. Scientific American. 78

[38]

D. G. Bobrow. Apr. 1980. Artificial Intelligence: Special Issue on Non-Monotonic Logic, vol. 13 no. 1-2. Elsevier. 21

[39]

H. Boley and M. Kifer, July 2013a. RIF Basic logic dialect. W3C Recommendation. Available at: http://www.w3.org/TR/rif-bld/. 78

[40]

H. Boley and M. Kifer, July 2013b. RIF Framework for logic dialects. W3C Recommendation. Available at: http://www.w3.org/TR/rif-fld/. 78

[41]

A. J. Bonner and M. Kifer. June 1993. Transaction Logic programming. In International Conference on Logic Programming, pp. 257--282. MIT Press. 43, 45

Digital Library

[42]

A. J. Bonner and M. Kifer. Oct. 1994. An overview of Transaction Logic. Theoretical Computer Science, 133: 205--265. 43, 45

Digital Library

[43]

A. J. Bonner and M. Kifer. Nov. 1995. Transaction Logic programming (or a logic of declarative and procedural knowledge). Technical Report CSRI-323, University of Toronto. Available at: http://www.cs.toronto.edu/~bonner/transaction-logic.html. 45

[44]

A. J. Bonner and M. Kifer. Sept. 1996. Concurrency and communication in Transaction Logic. In Joint International Conference and Symposium on Logic Programming, pp. 142--156. MIT Press. 45

[45]

A. J. Bonner and M. Kifer. 1998a. The state of change: A survey. In Freitag et al. {1998}. Springer. 39

[46]

A. J. Bonner and M. Kifer. 1998b. Results on reasoning about action in Transaction Logic. In Freitag et al. {1998}. Springer-Verlag. 46

[47]

A. J. Bonner, M. Kifer, and M. Consens. Aug./Sept. 1993. Database programming in Transaction Logic. In Proc. of the Fourth International Workshop on Database Programming Languages, pp. 309--337. 45

Digital Library

[48]

G. Brewka, J. Dix, and K. Konolige. 1997. Nonmonotonic Reasoning: An Overview, vol. 73 of CSLI Lecture Notes. CSLI Publications, Stanford, CA. 21

[49]

F. Bry. Oct. 1990. Query evaluation in recursive databases: Bottom-up and top-down reconciled. Data Knowledge Engineering, 5(4):289--312. 61

Digital Library

[50]

M. Calautti, G. Gottlob, and A. Pieris. 2015. Chase termination for guarded existential rules. In Proc. of the 34th ACM Symposium on Principles of Database Systems, PODS 2015, pp. 91--103. 27 A. Calì, G. Gottlob, and A. Pieris. 2011. New expressive languages for ontological query answering. In Proc. of the Twenty-Fifth AAAI Conference on Artificial Intelligence, AAAI 2011, pp. 1541--1546. 25, 28

Digital Library

[51]

A. Calì, G. Gottlob, and M. Kifer. 2013. Taming the infinite chase: Query answering under expressive relational constraints. Journal of Artificial Intelligence Research, 48: 115--174. 26, 28

[52]

M. J. Carey, D. J. DeWitt, J. E. Richardson, and E. J. Shekita. 1986. Object and file management in the EXODUS extensible database system. In Proc. of the 12th International Conference on Very Large Data Bases, VLDB '86, pp. 91--100. Morgan Kaufmann Publishers Inc., San Francisco, CA. 68

Digital Library

[53]

M. Carlsson et al. 2015. SICStus Prolog User's Manual. RISE SICS AB, Kista, Sweden. http://sicstus.sics.se/sicstus/docs/latest4/pdf/sicstus.pdf. 33

Digital Library

[54]

S. Ceri and L. Tanca. 1987. Optimization of systems of algebraic equations for evaluating Datalog queries. In Proc. of the 13th International Conference on Very Large Data Bases, VLDB '87, pp. 31--41. Morgan Kaufmann Publishers Inc., San Francisco, CA. 63

Digital Library

[55]

S. Ceri, G. Gottlob, and L. Lavazza. 1986. Translation and optimization of logic queries: The algebraic approach. In Proc. of the 12th International Conference on Very Large Data Bases, VLDB '86, pp. 395--402. Morgan Kaufmann Publishers Inc., San Francisco, CA. 63

Digital Library

[56]

S. Ceri, G. Gottlob, and G. Wiederhold. Feb. 1989. Efficient database access from Prolog. IEEE Trans. on Software Engineering, 15(2):153--164. 63

Digital Library

[57]

U. S. Chakravarthy, J. Grant, and J. Minker. June 1990. Logic-based approach to semantic query optimization. ACM Trans. on Database Systems, 15(2):162--207. 31

Digital Library

[58]

A. Chandra and D. Harel. Apr. 1985. Horn clause queries and generalizations. Journal of Logic Programming, 2(1):1--15. 77

[59]

C. Chang. 1977. DEDUCE 2: Further investigations of deduction in relational data bases. In H. Gallaire and J. Minker, editors, Logic and Data Bases, pp. 201--236, Plenum Press, New York. 13, 63

[60]

S. Chaudhuri. 1998. An overview of query optimization in relational systems. In Proc. of the Seventeenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pp. 34--43. ACM Press. 64

Digital Library

[61]

S. Chaudhuri and M. Y. Vardi. 1992. On the equivalence of recursive and nonrecursive datalog programs. In Proc. of the Eleventh ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, PODS '92, pp. 55--66. ACM. 64

Digital Library

[62]

W. Chen and D. S. Warren. Mar. 1989. C-logic for complex objects. In ACM Symposium on Principles of Database Systems, pp. 369--378. ACM. 33

Digital Library

[63]

W. Chen and D. S. Warren. Jan. 1996. Tabled evaluation with delaying for general logic programs. JACM, 43(1):20--74. 21, 59, 71

Digital Library

[64]

W. Chen, M. Kifer, and D. S. Warren. June 1989a. HiLog as a platform for database programming languages (or why predicate calculus is not enough). In Proc. of the Second International Workshop on Database Programming Languages, pp. 315--329. 37

Digital Library

[65]

W. Chen, M. Kifer, and D. S. Warren. Oct. 1989b. HiLog: A first-order semantics for higher-order logic programming constructs. In North American Conference on Logic Programming, pp. 1090--1114. MIT Press, Cambridge, MA. 37

[66]

W. Chen, M. Kifer, and D. S. Warren. Feb. 1993. HiLog: A foundation for higher-order logic programming. Journal of Logic Programming, 15(3):187--230. 37, 38

Digital Library

[67]

D. Chimenti, R. Gamboa, R. Krishnamurthy, S. Naqvi, S. Tsur, and C. Zaniolo. Mar. 1990. The LDL system prototype. IEEE Trans. on Knowledge and Data Engineering, 2(1):76--90. 66

Digital Library

[68]

B. Chin, D. von Dincklage, V. Ercegovac, P. Hawkins, M. S. Miller, F. Och, C. Olston, and F. Pereira. 2015. Yedalog: Exploring knowledge at scale. In 1st Summit on Advances in Programming Languages (SNAPL 2015), pp. 63--78. 83

[69]

J. Chomicki. 1990. Polynomial time query processing in temporal deductive databases. In ACM Symposium on Principles of Database Systems, pp. 379--391. 41

Digital Library

[70]

K. L. Clark. 1978. Negation as failure. In H. Gallaire and J. Minker, editors, Logic and Data Bases, pp. 293--322, Plenum Press, New York. 18

[71]

Coherent Knowledge LLC, 2017. Ergo Suite. Available at: http://coherentknowledge.com/. 28, 34, 38

[72]

A. Colmerauer and P. Roussel. 1996. The birth of Prolog. In T. J. Bergin, Jr. and R. G. Gibson, Jr., editors, History of Programming Languages---II, pp. 331--367. ACM. 11

Digital Library

[73]

N. Conway, W. R. Marczak, P. Alvaro, J. M. Hellerstein, and D. Maier. 2012. Logic and lattices for distributed programming. In Proc. of the Third ACM Symposium on Cloud Computing, SoCC '12, pp. 1:1--1:14. ACM. 25

Digital Library

[74]

C. Cornelio, A. Loreggia, and V. Saraswat. 2015. Logical conditional preference theories. Technical report, T.J. Watson Research Center. arXiv preprint: 1504.06374. 24

[75]

S. S. Cosmadakis, H. Gaifman, P. C. Kanellakis, and M. Y. Vardi. 1988. Decidable optimization problems for database logic programs (preliminary report). In Proc. of the 20th Annual ACM Symposium on Theory of Computing, pp. 477--490. 64

Digital Library

[76]

V. S. Costa, R. Rocha, and L. Damas. 2012. The YAP Prolog system. Theory and Practice of Logic Programming, 12(1-2):5--34. 52

Digital Library

[77]

F. Cuppens and R. Demolombe. 1988. A Prolog-relational DBMS interface using delayed evaluation. In Proc. of the Third International Conference on Data and Knowledge Bases: Improving Usability and Responsiveness, pp. 135--148. 63

[78]

B. P. L. da Silva, J.-F. Baget, and M. Croitoru. 2012. A generic platform for ontological query answering. In M. Bramer and M. Petridis, editors, Proc. of AI-2012, The Thirty-second SGAI International Conference on Innovative Techniques and Applications of Artificial Intelligence, pp. 151--164. Springer London, London, UK. 28

[79]

V. Dahl. Mar. 1982. On database systems development through logic. ACM Trans. on Database Systems, 7(1):102--123. 14

Digital Library

[80]

V. Dahl. 1986. Logic programming for constructive expert database systems. In Proc. from the First International Workshop on Expert Database Systems, pp. 209--217. Benjamin-Cummings Publishing Co., Inc., Redwood City, CA. 14

Digital Library

[81]

E. Dantsin, T. Eiter, G. Gottlob, and A. Voronkov. Sept. 2001. Complexity and expressive power of logic programming. ACM Computing Surveys, 33(3):374--425. 77

Digital Library

[82]

R. Davis. Feb. 1986. Knowledge-based systems. Science, 231(4741):957--964. 14

[83]

O. de Moor, M. Verbaere, E. Hajiyev, P. Avgustinov, T. Ekman, N. Ongkingco, D. Sereni, and J. Tibble. 2007. Keynote address: .QL for source code analysis. In Proc. of the Seventh IEEE International Working Conference on Source Code Analysis and Manipulation, SCAM '07, pp. 3--16. IEEE Computer Society. 79, 80

Digital Library

[84]

C. de Sainte Marie, G. Hallmark, and A. Paschke, Feb. 2013. RIF production rule dialect. W3C Recommendation. Available at: http://www.w3.org/TR/rif-prd/. 42

[85]

H. Decker. 1986. Integrity enforcement on deductive databases. In Proc. of the Expert Database Conference, pp. 381--395. 31

[86]

S. Decker, D. Brickley, J. Saarela, and J. Angele. Dec. 1998. A query and inference service for RDF. In QL'98---The Query Languages Workshop. 78

[87]

M. Denecker, M. Bruynooghe, and V. W. Marek. 2001. Logic programming revisited: Logic programs as inductive definitions. ACM Trans. Comput. Log., 2(4):623--654. 22

Digital Library

[88]

M. A. Derr, S. Morishita, and G. Phipps. Apr. 1994. The Glue-Nail deductive database system: Design, implementation, and evaluation. The VLDB Journal, 3(2):123--160. 68

Digital Library

[89]

A. Deutsch, A. Nash, and J. Remmel. 2008. The chase revisited. In Proc. of the Twenty-seventh ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS '08, pp. 149--158. ACM. 26, 27

Digital Library

[90]

S. W. Dietrich. 1987. Extension tables: Memo relations in logic programming. In Proc. of the 1987 Symposium on Logic Programming, pp. 264--272. 59

[91]

S. W. Dietrich and D. S. Warren. 1986. Extension tables: Memo relations in logic programming. Technical Report 86/18, Dept. of Computer Science, SUNY at Stony Brook. 59

[92]

C. Draxler. Aug. 1993. A powerful Prolog to SQL compiler. Technical report, CIS Centre for Information Processing. 63

[93]

T. Eiter, G. Gottlob, and H. Mannila. Sept. 1997. Disjunctive Datalog. ACM Trans. Database Syst., 22(3):364--418. 22

Digital Library

[94]

T. Eiter, T. Lukasiewicz, R. Schindlauer, and H. Tompits. June 2004a. Combining answer set programming with description logics for the semantic web. In Proc. of the International Conference of Knowledge Representation and Reasoning (KR'04), pp. 141--151. 78

Digital Library

[95]

T. Eiter, T. Lukasiewicz, R. Schindlauer, and H. Tompits. Oct. 2004b. Well-founded semantics for description logic programs in the semantic Web. In Rules and Rule Markup Languages for the Semantic Web, pp. 81--97. 78

[96]

T. Feder and M. Y. Vardi. Feb. 1999. The computational structure of monotone monadic SNP and constraint satisfaction: A study through Datalog and group theory. SIAM J. Computing, 28(1):57--104. 77

Digital Library

[97]

C. Fellenstein, C. O. Green, L. M. Palmer, A. Walker, and D. J. Wyler. July 1985. A prototype manufacturing knowledge base in Syllog. IBM Journal of Research and Development, 29(4):413--421. 14

[98]

N. V. Findler, editor. 1979. Associative Networks: The Representation and Use of Knowledge by Computers. Academic Press, Inc., Orlando, FL, USA. 14

Digital Library

[99]

P. Fodor and M. Kifer. July 2011. Transaction Logic with defaults and argumentation theories. In International Conference on Logic Programming, pp. 162--174. 45

[100]

M. Freeston. 1987. The BANG file: A new kind of grid file. In Proc. of the 1987 ACM SIGMOD International Conference on Management of Data, SIGMOD '87, pp. 260--269. ACM. 69

Digital Library

[101]

J. Freire, T. Swift, and D. S. Warren. July 1997. Taking I/O seriously: Resolution reconsidered for disk. In Proc. of the Joint Conference and Symposium on Logic Programming, pp. 198--212. MIT Press. 72

[102]

B. Freitag, H. Schütz, and G. Specht. 1992. LOLA---a logic language for deductive databases and its implementation. In Proc. of the Second International Symposium on Database Systems for Advanced Applications, pp. 216--225. World Scientific Press. 73

Digital Library

[103]

B. Freitag, H. Decker, M. Kifer, and A. Voronkov, editors. 1998. Transactions and Change in Logic Databases, vol. 1472 of LNCS. Springer-Verlag, Berlin. 103

[104]

J. Frohn, R. Himmeroöder, G. Lausen, W. May, and C. Schlepphorst. 1998. Managing semistructured data with FLORID: A deductive object-oriented perspective. Information Systems, 23(8):589--613. 34, 36, 73

Digital Library

[105]

K. Fuchi. 1981. Aiming for knowledge information processing systems. In Proc. of the International Conference on Fifth Generation Computer Systems, pp. 110--117. 12

[106]

K. Fuchi and K. Furukawa. Apr. 1987. The role of logic programming in the Fifth Generation Computer Project. New Generation Computing, 5(1):3--28. 12

Digital Library

[107]

T. Furche, G. Gottlob, G. Grasso, X. Guo, G. Orsi, C. Schallhart, and C. Wang. Oct. 2014. DIADEM: Thousands of websites to a single database. Proc. VLDB Endow, 7(14):1845--1856. 83

Digital Library

[108]

F. Furfaro, S. Greco, S. Ganguly, and C. Zaniolo. 2002. Pushing extrema aggregates to optimize logic queries. Information Systems, 27(5):321--343. 82

Digital Library

[109]

H. Gaifman, H. G. Mairson, Y. Sagiv, and M. Y. Vardi. 1993. Undecidable optimization problems for database logic programs. J. ACM, 40(3):683--713. 64

Digital Library

[110]

H. Gallaire and J. Minker, editors. 1978. Logic and Data Bases, Symposium on Logic and Data Bases, Advances in Data Base Theory, Plenum Press, New York.

[111]

H. Gallaire, J. Nicolas, and J. Minker, editors. 1981. Advances in Data Base Theory, Vol. 1, Based on the Proc. of the Workshop on Formal Bases for Data Bases, Advances in Data Base Theory, Plenum Press, New York.

Digital Library

[112]

H. Garcia-Molina, J. D. Ullman, and J. Widom. 2009. Database Systems: The Complete Book (2nd ed.). Pearson Education. 6

Digital Library

[113]

M. Gelfond and V. Lifschitz. 1988. The stable model semantics for logic programming. In Logic Programming: Proc. of the Fifth Conference and Symposium, pp. 1070--1080. MIT Press. 20, 21

[114]

R. G. Goebel. 1985. A Logic Data Model for the Machine Representation of Knowledge. Ph.D. thesis, University of British Columbia. 14

Digital Library

[115]

J. E. Gonzalez, R. S. Xin, A. Dave, D. Crankshaw, M. J. Franklin, and I. Stoica. 2014. GraphX: Graph processing in a distributed dataflow framework. In Proceedings of the 11th USENIX Conference on Operating Systems Design and Implementation, OSDI'14, pp. 599--613. USENIX Association, Berkeley, CA. 83

Digital Library

[116]

G. Gottlob and C. Koch. Jan. 2004. Monadic datalog and the expressive power of languages for Web information extraction. J. ACM, 51(1):74--113. 77

Digital Library

[117]

G. Gottlob and C. H. Papadimitriou. 1999. On the complexity of single-rule datalog queries. In Proc. of the 6th International Conference on Logic Programming and Automated Reasoning, LPAR '99, pp. 201--222. Springer-Verlag, London, UK. 77

Digital Library

[118]

G. Gottlob, S. Ceri, and L. Tanca. Mar. 1989. What you always wanted to know about Datalog (and never dared to ask). IEEE Trans. on Knowledge & Data Engineering, 1(1):146--166. 60

Digital Library

[119]

G. Gottlob, C. Koch, R. Baumgartner, M. Herzog, and S. Flesca. 2004. The Lixto data extraction project: Back and forth between theory and practice. In Proc. of the Twenty-third ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS '04, pp. 1--12. ACM. 83

Digital Library

[120]

G. Gottlob, M. Manna, and A. Pieris. 2013. Combining decidability paradigms for existential rules. TPLP, 13(4-5):877--892. 28

[121]

G. Gottlob, T. Lukasiewicz, and A. Pieris. 2014. Datalog<sup>±</sup>: Questions and answers. In Proc. of the Fourteenth International Conference on Principles of Knowledge Representation and Reasoning, KR 2014, pp. 682--685. 25

Digital Library

[122]

J. Grant and J. Minker. 1981. Optimization in deductive and conventional relational database systems. In H. Gallaire, J. Nicolas, and J. Minker, editors, Advances in Data Base Theory, pp. 195--234, Vol. 1. Plenum Press, New York. 63

[123]

B. C. Grau, I. Horrocks, B. Motik, B. Parsia, P. Patel-Schneider, and U. Sattler. Nov. 2008. OWL 2: The next step for OWL. Web Semantics, 6(4):309--322. 78

Digital Library

[124]

C. C. Green. 1969. Application of theorem proving to problem solving. In International Joint Conference on Artificial Intelligence, pp. 219--240. 14, 41

Digital Library

[125]

C. C. Green and B. Raphael. 1968. The use of theorem-proving techniques in question-answering systems. In Proc. of the 1968 23rd ACM National Conference, ACM '68, pp. 169--181. ACM. 13

Digital Library

[126]

B. Grosof and T. Swift. July 2013. Radial restraint: A semantically clean approach to bounded rationality for logic programs. In AAAI Conference on Artificial Intelligence. AAAI Press. 28

Digital Library

[127]

R. V. Guha, O. Lassila, E. Miler, and D. Brickley. Dec. 1998. Enabling inferencing. In QL'98---The Query Languages Workshop. 78

[128]

H. Guo and G. Gupta. Nov. 2001. A simple scheme for implementing tabled logic programming systems based on dynamic reordering of alternatives. In Proc. of the 17th International Conference on Logic Programming, ICLP 2001, pp. 181--196. 59

Digital Library

[129]

L. M. Haas, J. C. Freytag, G. M. Lohman, and H. Pirahesh. 1989. Extensible query processing in Starburst. In Proc. of the 1989 ACM SIGMOD International Conference on Management of Data, SIGMOD '89, pp. 377--388. ACM. 73

Digital Library

[130]

C. D. Hafner and K. Godden. Apr. 1985. Portability of syntax and semantics in DATALOG. ACM Trans. on Information Systems, 3(2):141--164. 16

Digital Library

[131]

E. Hajiyev, M. Verbaere, and O. de Moor. 2006. CodeQuest: Scalable source code queries with Datalog. In Proc. of the 20th European Conference on Object-Oriented Programming, ECOOP'06, pp. 2--27. Springer-Verlag, Berlin, Heidelberg. 79

Digital Library

[132]

D. Harel. 1979. First-Order Dynamic Logic, vol. 68 of Lecture Notes in Computer Science. Springer-Verlag. 39

[133]

D. Harel, D. Kozen, and R. Parikh. Oct. 1982. Process Logic: Expressiveness, decidability, completeness. Journal of Computer and System Sciences, 25(2):144--170. 39

[134]

P. J. Hayes. 1977. In defence of logic. In Proc. of the 5th International Joint Conference on Artificial Intelligence, Vol. 1, IJCAI'77, pp. 559--565. Morgan Kaufmann Publishers Inc., San Francisco, CA. 14

Digital Library

[135]

P. J. Hayes. 1980. The logic of frames. In Frame Conceptions and Text Understanding, pp. 46--61. Walter de Gruyter, Berlin. 14

[136]

A. Heuer and P. Sander. 1989. Semantics and evaluation of rules over complex objects. In International Conference on Deductive and Object-Oriented Databases, pp. 439--458. 33

[137]

M. A. W. Houtsma and P. M. G. Apers. 1992. Algebraic optimization of recursive queries. Data & Knowledge Engineering, 7(4):299--325. 63

Digital Library

[138]

N. Immerman. 1982. Relational queries computable in polynomial time (extended abstract). In Proceedings of the Fourteenth Annual ACM Symposium on Theory of Computing, STOC '82, pp. 147--152. ACM. 77

Digital Library

[139]

Y. E. Ioannidis, J. Chen, M. A. Friedman, and M. M. Tsangaris. 1988. Bermuda---an architectural perspective on interfacing Prolog to a database machine. In Expert Database Conference, pp. 229--255. 63

[140]

Z. G. Ives, T. J. Green, G. Karvounarakis, N. E. Taylor, V. Tannen, P. P. Talukdar, M. Jacob, and F. Pereira. Sept. 2008. The ORCHESTRA collaborative data sharing system. SIGMOD Rec., 37(3):26--32. 83

Digital Library

[141]

D. S. Johnson and A. Klug. 1984. Testing containment of conjunctive queries under functional and inclusion dependencies. Journal of Computer and System Sciences, 28: 167--189. 27, 28, 32

[142]

N. D. Jones, C. K. Gomard, and P. Sestoft. 1993. Partial Evaluation and Automatic Program Generation. Prentice-Hall, Inc., Upper Saddle River, NJ. 51

Digital Library

[143]

C. Kellogg, P. Klahr, and L. Travis. 1977. Deductive planning and pathfinding for relational data bases. In H. Gallaire and J. Minker, editors, Logic and Data Bases, pp. 179--200, Plenum Press, New York. 13, 63

[144]

D. B. Kemp and P. J. Stuckey. Oct. 1991. Semantics of logic programs with aggregates. In Proc. of International Symposium on Logic Programming, pp. 387--401. MIT Press. 24

[145]

L. Kerschberg. 1990. Expert database systems: Knowledge/data management environments for intelligent information systems. Information Systems, 15(1):151--160. 14

Digital Library

[146]

G. Kiernan, C. de Maindreville, and E. Simon. 1990. Making deductive databases a practical technology: A step forward. In Proc. of the 1990 ACM SIGMOD International Conference on Management of Data, SIGMOD '90, pp. 237--246. ACM. 73

Digital Library

[147]

W. Kießling, H. Schmidt, W. Strauß, and G. Dünzinger. Apr. 1994. DECLARE and SDS: Early efforts to commercialize deductive database technology. The VLDB Journal, 3(2):211--243. 72

Digital Library

[148]

M. Kifer, 2015. Knowledge representation & reasoning with Flora-2. The Flora-2 Web Site. Available at: http://flora.sourceforge.net. 34, 38, 46, 91

[149]

M. Kifer and G. Lausen. 1989. F-Logic: A higher-order language for reasoning about objects, inheritance and schema. In ACM SIGMOD Conference on Management of Data, pp. 134--146. ACM. 33, 34

Digital Library

[150]

M. Kifer and A. Li. Sept. 1988. On the semantics of rule based expert systems with uncertainty. In International Conference on Database Theory, vol. 326 of Lecture Notes in Computer Science, pp. 186--202. Springer-Verlag. 14

Digital Library

[151]

M. Kifer and E. L. Lozinskii. Feb. 1987. Implementing logic programs as a database system. In IEEE 3rd International Conference on Data Engineering, pp. 375--385. 51

Digital Library

[152]

M. Kifer and E. L. Lozinskii. 1988. SYGRAF: Implementing logic programs in a database style. IEEE Trans. on Software Engineering, 14(7):922--935. 51

Digital Library

[153]

M. Kifer and E. L. Lozinskii. Sept. 1990. On compile-time query optimization in deductive databases by means of static filtering. ACM Trans. on Database Systems, 15(3):385--426. 51

Digital Library

[154]

M. Kifer and J. Wu. Mar. 1989. A logic for object-oriented logic programming (Maier's O-logic revisited). In ACM Symposium on Principles of Database Systems, pp. 379--393. ACM. 33, 34

Digital Library

[155]

M. Kifer and J. Wu. Aug. 1993. A logic for programming with complex objects. Journal of Computer and System Sciences, 47(1):77--120. 34

Digital Library

[156]

M. Kifer, G. Lausen, and J. Wu. July 1995. Logical foundations of object-oriented and frame-based languages. Journal of ACM, 42: 741--843. 33, 34, 35

Digital Library

[157]

R. A. Kowalski. June 1974. Predicate logic as programming language. In Proceedings of the IFIP Congress, vol. 74, pp. 569--544. 11

[158]

R. A. Kowalski. Jan. 1988. The early years of logic programming. Commun. ACM, 31(1):38--43. 11

Digital Library

[159]

R. A. Kowalski. 2014. Logic programming. In J. Siekmann, editor, Computational Logic, vol. 9 of History of Logic. D. Gabbay and J. Woods, editors, pp. 523--569. Elsevier. 12

[160]

R. A. Kowalski and F. Sadri. 2012. A logic-based framework for reactive systems. In Rules on the Web: Research and Applications, RuleML 2012, vol. 7438 of Lecture Notes in Computer Science, pp. 1--15. Springer. 43

Digital Library

[161]

R. A. Kowalski and M. Sergot. 1986. A logic-based calculus of events. New Generation Computing, 4: 67--95. 41

Digital Library

[162]

R. A. Kowalski, F. Sadri, and P. Soper. 1987. Integrity checking in deductive databases. In Proc. of the 13th International Conference on Very Large Data Bases, VLDB 87, pp. 61--69. Morgan Kaufmann Publishers Inc., San Francisco, CA. 29, 31

Digital Library

[163]

L. V. S. Lakshmanan and R. Missaoui. 1992. On semantic query optimization in deductive databases. In Proc. of the Eighth International Conference on Data Engineering, pp. 368--375. IEEE Computer Society. 32

Digital Library

[164]

L. V. S. Lakshmanan, I. N. Subramanian, and F. Sadri. 1996. A declarative language for querying and restructuring the Web. In Proc. of the 6th International Workshop on Research Issues in Data Engineering (RIDE '96) Interoperability of Nontraditional Database Systems, RIDE '96, pp. 12--21. IEEE Computer Society. 36, 73

Digital Library

[165]

M. S. Lam, J. Whaley, V. B. Livshits, M. C. Martin, D. Avots, M. Carbin, and C. Unkel. 2005. Context-sensitive program analysis as database queries. In Proc. of the Twenty-fourth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS '05, pp. 1--12. ACM. 79, 80

Digital Library

[166]

M. S. Lam, S. Guo, and J. Seo. 2013. SociaLite: Datalog extensions for efficient social network analysis. In Proc. of the 2013 IEEE International Conference on Data Engineering (ICDE 2013), ICDE '13, pp. 278--289. IEEE Computer Society. 82

Digital Library

[167]

O. Lassila and R. R. Swick. Feb. 1999. Resource description framework (RDF) model and syntax specification. Technical report, W3C. Available at: http://www.w3.org/TR/1999/REC-rdf-syntax-19990222/. 34, 78

[168]

G. Lausen and B. Ludäscher. 1995. Updates by reasoning about states. In Eder J., Kalinichenko L.A. (editors) East/West Database Workshop. Workshops in Computing. Springer, London. 41

[169]

S. Lee and J. Han. 1988. Semantic query optimization in recursive databases. In Proc. of the Fourth International Conference on Data Engineering, pp. 444--451. IEEE Computer Society. 32

Digital Library

[170]

N. Leone, G. Pfeifer, W. Faber, T. Eiter, G. Gottlob, S. Perri, and F. Scarcello. July 2006. The DLV system for knowledge representation and reasoning. ACM Trans. on Computational Logic, 7(3):499--562. 83

Digital Library

[171]

A. Y. Levy and Y. Sagiv. 1995. Semantic query optimization in datalog programs (extended abstract). In Proc. of the Fourteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, PODS '95, pp. 163--173. ACM. 32

Digital Library

[172]

Y. A. Liu and S. D. Stoller. 2009. From Datalog rules to efficient programs with time and space guarantees. ACM Trans. Prog. Lang. Syst., 31(6):1--38. 49, 52, 535

Digital Library

[173]

Y. A. Liu and S. D. Stoller. Jan. 2018. Founded semantics and constraint semantics of logic rules. In International Symposium on Logical Foundations of Computer Science, vol. 10703 of Lecture Notes in Computer Science, pp. 221--241. Springer. 22

[174]

J. W. Lloyd. 1993. Foundations of Logic Programming, 2nd. Springer-Verlag New York, Inc., Secaucus, NJ. 9, 11

Digital Library

[175]

J. W. Lloyd, L. Sonenberg, and R. W. Topor. 1987. Integrity constraint checking in stratified databases. Journal of Logic Programming, 4(4):331--343. 30

Digital Library

[176]

B. T. Loo, T. Condie, J. M. Hellerstein, P. Maniatis, T. Roscoe, and I. Stoica. 2005. Implementing declarative overlays. In Proc. of the Twentieth ACM Symposium on Operating Systems Principles, SOSP '05, pp. 75--90. ACM. 81

Digital Library

[177]

B. T. Loo, T. Condie, M. Garofalakis, D. E. Gay, J. M. Hellerstein, P. Maniatis, R. Ramakrishnan, T. Roscoe, and I. Stoica. 2006. Declarative networking: Language, execution and optimization. In Proc. of the 2006 ACM SIGMOD International Conference on Management of Data, SIGMOD '06, pp. 97--108. ACM. 80, 81

Digital Library

[178]

B. T. Loo, T. Condie, M. Garofalakis, D. E. Gay, J. M. Hellerstein, P. Maniatis, R. Ramakrishnan, T. Roscoe, and I. Stoica. Nov. 2009. Declarative networking. Commun. ACM, 52(11):87--95. 80

Digital Library

[179]

D. Maier. Aug. 1986a. A logic for objects. In Workshop on Foundations of Deductive Databases and Logic Programming, pp. 6--26. Washington D.C. 33, 34

[180]

D. Maier. 1986b. Databases in the Fifth Generation project: Is Prolog a database language? In G. Ariav and J. Clifford, editors, New Directions for Database Systems, pp. 18--34. Ablex Publishing Corporation. 12

[181]

D. Maier and D. S. Warren. 1981. Incorporating computed relations in relational databases. In Proc. of the 1981 ACM SIGMOD International Conference on Management of Data, SIGMOD '81, pp. 176--187. ACM. 23

Digital Library

[182]

D. Maier and D. S. Warren. 1988. Computing with Logic: Logic Programming with Prolog. Benjamin/Cummings. 15

Digital Library

[183]

D. Maier, A. O. Mendelzon, and Y. Sagiv. 1979. Testing implications of data dependencies. Trans. Database Syst., 4(4):455--469. 27

Digital Library

[184]

F. Maier, D. Nute, W. D. Potter, J. Wang, M. J. Twery, H. M. Rauscher, P. Knopp, S. Thomasma, M. Dass, and H. Uchiyama. 2002. PROLOG/RDBMS integration in the NED intelligent information system. In On the Move to Meaningful Internet Systems, 2002---DOA/CoopIS/ODBASE Proc. of the Confederated International Conferences DOA, CoopIS and ODBASE, p. 528. 63

Digital Library

[185]

V. W. Marek and M. Truszczyński. 1999. Stable models and an alternative logic programming paradigm. In K. R. Apt, V. W. Marek, M. Truszczynski, and D. S. Warren, editors, The Logic Programming Paradigm: A 25-Year Perspective, pp. 375--398. Springer, Berlin, Heidelberg. 22

[186]

D. Martinenghi, H. Christiansen, and H. Decker. 2006. Integrity checking and maintenance in relational and deductive databases and beyond. In Z. Ma, editor, Intelligent Databases: Technologies and Applications, pp. 238--285. Idea Group Publishing. 30, 31

[187]

MathGen, 2000. Mathematics Genealogy Project. Available at: http://genealogy.math.ndsu.nodak.edu/. Last accessed 1 August 2016. 84

[188]

F. G. McCabe. 1992. Logic and Objects. Prentice Hall International, London, England. 33

Digital Library

[189]

J. M. McCarthy and P. J. Hayes. 1969. Some philosophical problems from the standpoint of artificial intelligence. In B. Meltzer and D. Michie, editors, Machine Intelligence, vol. 4, pp. 463--502. Edinburgh University Press. Reprinted in Readings in Artificial Intelligence, 1981, Tioga Publishing Co. 40

[190]

D. A. Miller and G. Nadathur. July 1986. Higher-order logic programming. In International Conference on Logic Programming, vol. 225 of Lecture Notes in Computer Science, pp. 448--462. Springer-Verlag. 38

Digital Library

[191]

J. Minker. 1977. An experimental relational data base system based on logic. In H. Gallaire and J. Minker, editors, Logic and Data Bases, pp. 107--147, Plenum Press, New York. 13

[192]

J. Minker. Mar. 1994. Overview of disjunctive logic programming. Annals of Mathematics and Artificial Intelligence, 12(1): 1--24. 22

[193]

J. Minker and D. Seipel. 2002. Disjunctive logic programming: A survey and assessment. In Computational Logic: Logic Programming and Beyond, pp. 171--197. Springer. 22

Digital Library

[194]

J. Minker, D. Seipel, and C. Zaniolo. 2014. Logic and databases: A history of deductive databases. In J. H. Siekmann, editor, Computational Logic, vol. 9 of Handbook of the History of Logic, pp. 571--627. Elsevier. 13, 15

[195]

M. Minsky. 1975. A framework for representing knowledge. In P. Winston, editor, The Psychology of Computer Vision, pp. 211--277. McGraw-Hill, New York. 14, 35

[196]

S. Morishita. 1993. An alternating fixpoint tailored to magic programs. In Proc. of the Twelfth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, PODS '93, pp. 123--134. ACM. 69

Digital Library

[197]

K. A. Morris, J. D. Ullman, and A. Van Gelder. 1986. Design overview of the NAIL! system. In Proc. of the Third International Conference on Logic Programming, pp. 554--568. Springer-Verlag, London, UK. 68

Digital Library

[198]

C. Moss. 1994. Prolog++: The Power of Object-Oriented and Logic Programming. Addison-Wesley. 33

Digital Library

[199]

B. Motik, I. Horrocks, R. Rosati, and U. Sattler. Nov. 2006. Can OWL and logic programming live together happily ever after? In International Semantic Web Conference (ISWC2006), pp. 501--514. 78

Digital Library

[200]

T. Moto-oka and H. S. Stone. Mar. 1984. Fifth-generation computer systems: A Japanese project. Computer, 17(3):6--13. 12, 48

Digital Library

[201]

P. Moura. July 2000. Logtalk documentation. Technical Report DMI-2000/1, University of Beira Interior, Portugal. Available at: http://logtalk.org/papers/trdmi20001us.pdf. 33

[202]

P. Moura, P. Crocker, and P. Nunes. Jan. 2008. High-level multi-threading programming in logtalk. In Practical Aspects of Declarative Languages (PADL), vol. 4902 of Lecture Notes in Computer Science. Springer. 33

Digital Library

[203]

I. S. Mumick and H. Pirahesh. May 1994. Implementation of Magic-sets in a relational database system. SIGMOD Rec., 23(2):103--114. 73

Digital Library

[204]

S. Naqvi and R. Krishnamurthy. Mar. 1988. Database updates in logic programming. In ACM Symposium on Principles of Database Systems, pp. 251--262. ACM. 46

Digital Library

[205]

S. Naqvi and S. Tsur. 1989. A Logical Language for Data and Knowledge Bases. Computer Science Press, Rockville, MD. 46

Digital Library

[206]

J. Naughton. 1986. Data independent recursion in deductive databases. In Proc. of the Fifth ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, PODS '86, pp. 267--279. ACM. 64

Digital Library

[207]

W. Nejdl. 1987. Recursive strategies for answering recursive queries---the RQA/FQI strategy. In Proc. of the 13th International Conference on Very Large Data Bases, VLDB '87, pp. 43--50. Morgan Kaufmann Publishers Inc., San Francisco, CA. 60

Digital Library

[208]

J. Nicolas and H. Gallaire. 1977. Data base: Theory vs. interpretation. In H. Gallaire and J. Minker, editors, Logic and Data Bases, pp. 33--54, Plenum Press, NewYork. 13, 19

[209]

J. Nicolas and K. Yazdanian. 1977. Integrity checking in deductive data bases. In H. Gallaire and J. Minker, editors, Logic and Data Bases, pp. 325--344, Plenum Press, New York. 29

[210]

C. H. Papadimitriou. 1985. A note the expressive power of Prolog. Bulletin of the EATCS, 26: 21--22. 77

[211]

J. Paredaens. 1978. On the expressive power of the relational algebra. Information Processing Letters, 7(2):107--111. 13

[212]

N. Pelov, M. Denecker, and M. Bruynooghe. May 2007. Well-founded and stable semantics of logic programs with aggregates. Theory and Practice of Logic Programming, 7(03):301--353. 24

Digital Library

[213]

A. Polleres. 2007. From SPARQL to rules (and back). In Proc. of the 16th International Conference on World Wide Web, WWW '07, pp. 787--796. ACM. 76

Digital Library

[214]

H. H. Porter, Oct. 1985. Optimizations to Earley deduction for DATALOG programs. Available at: http://www.cs.pdx.edu/~harry/earley/datalog.pdf. 16

[215]

E. Prud'hommeaux, A. Seaborne, et al. 2008. SPARQL query language for RDF. W3C recommendation 15 January2008. http://www.w3.org/TR/rdf-sparql-query/. 88

[216]

T. C. Przymusinski. 1988a. On the declarative semantics of deductive databases and logic programs. In Foundations of Deductive Databases and Logic Programming, pp. 193--216. Morgan Kaufmann. 20

Digital Library

[217]

T. C. Przymusinski. 1988b. Perfect model semantics. In Proc. of the Fifth International Conference and Symposium on Logic Programming, pp. 1081--1096. 19

[218]

T. C. Przymusinski. 1989. Every logic program has a natural stratification and an iterated least fixed point model. In Proc. of the Eighth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, PODS '89, pp. 11--21. ACM. 20

Digital Library

[219]

F. Puppe. 1993. Characterization and history of expert systems. In Systematic Introduction to Expert Systems, pp. 3--8. Springer. 14

[220]

R. Ramakrishnan. Oct./Nov. 1991. Magic templates: A spellbinding approach to logic programs. Journal of Logic Programming, 11(3-4):189--216. 51, 68

Digital Library

[221]

R. Ramakrishnan and J. D. Ullman. 1995. A survey of deductive database systems. Journal of Logic Programming, 23(2):125--149. 65

[222]

R. Ramakrishnan, D. Srivastava, S. Sudarshan, and P. Seshadri. Apr. 1994. The CORAL deductive system. The VLDB Journal, 3(2):161--210. 67

Digital Library

[223]

K. Ramamohanarao, J. Shepherd, I. Balbin, G. S. Port, L. Naish, J. A. Thom, J. Zobel, and P. W. Dart. 1988. The NU-Prolog deductive database system. In Prolog and Databases, pp. 212--250. Halsted Press. 72

Digital Library

[224]

R. Reiter. 1977a. Deductive question-answering on relational data bases. In H. Gallaire and J. Minker, editors, Logic and Data Bases, pp. 149--177, Plenum Press, New York. 13, 63

[225]

R. Reiter. 1977b. On closed world data bases. In H. Gallaire and J. Minker, editors, Logic and Data Bases, pp. 55--76, Plenum Press, New York. 13, 21

[226]

R. Reiter. 1981. On the integrity of typed first order data bases. In H. Gallaire, J. Nicolas, and J. Minker, editors, Advances in Data Base Theory, pp. 137--157, Vol. 1. Plenum Press, New York. 31

[227]

R. Reiter. 1991. The frame problem in the situation calculus: A simple solution (sometimes) and a completeness result for goal regression. In V. Lifschitz, editor, Aritifial Intelligence and Mathematical Theory of Computation: Papers in Honor of John McCarty, pp. 359--380. Academic Press. 41

Digital Library

[228]

M. Rezk and M. Kifer. 2012. Transaction Logic with partially defined actions. Journal of Data Semantics, 1(2):99--131. 46

[229]

J. A. Robinson. 1965. A machine-oriented logic based on the resolution principle. Journal of the ACM, 12(1):23--41. 11

Digital Library

[230]

D. Roman and M. Kifer. Sept. 2007. Reasoning about the behavior of semantic Web services with Concurrent Transaction Logic. In International Conference on Very Large Data Bases (VLDB), pp. 627--638. 46

Digital Library

[231]

A. Rosenthal, S. Heiler, U. Dayal, and F. Manola. June 1986. Traversal recursion: A practical approach to supporting recursive applications. SIGMOD Rec., 15(2):166--176. 13

Digital Library

[232]

K. A. Ross and Y. Sagiv. 1992. Monotonic aggregation in deductive databases. In Proc. of the Eleventh ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, PODS '92, pp. 114--126. ACM. 25

Digital Library

[233]

D. Saccà and C. Zaniolo. 1986a. The generalized counting method for recursive logic queries. In G. Ausiello and P. Atzeni, editors, ICDT'86, International Conference on Database Theory, Rome, Italy, Sept. 8-10, 1986, vol. 243 of Lecture Notes in Computer Science, pp. 31--53. Springer. 51, 66

Digital Library

[234]

D. Saccà and C. Zaniolo. 1986b. On the implementation of a simple class of logic queries for databases. In A. Silberschatz, editor, Proc. of the Fifth ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, pp. 16--23. ACM. 51

Digital Library

[235]

Y. Sagiv. 1987. Optimizing Datalog programs. In Proc. of the Sixth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, PODS '87, pp. 349--362. ACM. 32, 64

Digital Library

[236]

K. Sagonas, T. Swift, and D. S. Warren. May 1994. XSB as an efficient deductive database engine. In Proc. of the 1994 ACM SIGMOD International Conference on Management of Data, pp. 442--453. 71, 85

Digital Library

[237]

Semafora, GmbH, 1999. Ontobroker. Available at: http://www.semafora-systems.com/en/. 34

[238]

J. Seo, J. Park, J. Shin, and M. S. Lam. Sept. 2013. Distributed SociaLite: A Datalog-based language for large-scale graph analysis. Proc. of the VLDB Endowment, 6(14):1906--1917. 82

Digital Library

[239]

A. Shkapsky, K. Zeng, and C. Zaniolo. Aug. 2013. Graph queries in a next-generation Datalog system. Proc. of the VLDB Endowment, 6(12):1258--1261. 65, 83

Digital Library

[240]

A. Shkapsky, M. Yang, M. Interlandi, H. Chiu, T. Condie, and C. Zaniolo. 2016. Big data analytics with Datalog queries on Spark. In Proc. of the 2016 International Conference on Management of Data, SIGMOD '16, pp. 1135--1149. ACM. 83

Digital Library

[241]

O. Shmueli. 1993. Equivalence of DATALOG queries is undecidable. J. Log. Program., 15(3):231--241. 64

Digital Library

[242]

Y. Smaragdakis and M. Bravenboer. 2011. Using Datalog for fast and easy program analysis. In Proc. of the First International Conference on Datalog Reloaded, Datalog'10, pp. 245--251. Springer-Verlag, Berlin, Heidelberg. 79, 80

Digital Library

[243]

W. Snyder and J. Schmolze. July 1996. Rewrite semantics for production rule systems: Theory and applications. In 13th International Conference on Automated Deduction, vol. 1104 of LNAI, pp. 508--522. Springer. 42

Digital Library

[244]

T. Swift and D. S. Warren. 2011. XSB: Extending the power of Prolog using tabling. Theory and Practice of Logic Programming, vol. 12, no. 1-2, pp. 157--187. Cambridge University Press. 24, 28, 52, 59

Digital Library

[245]

H. Tamaki and T. Sato. 1986. OLD resolution with tabulation. In Third International Conference on Logic Programming, pp. 84--98. 59

Digital Library

[246]

P. Tarau. 2004. Agent-oriented logic programming constructs in Jinni. In International Conference on Logic Programming, vol. 3132 of Lecture Notes in Computer Science. 33

[247]

K. T. Tekle and Y. A. Liu. 2010. Precise complexity analysis for efficient datalog queries. In Proc. of the 12th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, pp. 35--44. 52, 58, 61, 93

Digital Library

[248]

K. T. Tekle and Y. A. Liu. 2011. More efficient Datalog queries: subsumptive tabling beats magic sets. In T. K. Sellis, R. J. Miller, A. Kementsietsidis, and Y. Velegrakis, editors, Proc. of the ACM SIGMOD International Conference on Management of Data, SIGMOD 2011, pp. 661--672. ACM. 52, 58, 61

Digital Library

[249]

K. T. Tekle, K. Hristova, and Y. A. Liu. 2008. Generating specialized rules and programs for demand-driven analysis. In Algebraic Methodology and Software Technology, 12th International Conference, AMAST 2008, Urbana, IL, USA, July 28-31, pp. 346--361. 51, 93

Digital Library

[250]

S. Tsur and C. Zaniolo. 1986. LDL: A logic-based data language. In Proc. of the 12th International Conference on Very Large Data Bases, VLDB '86, pp. 33--41. Morgan Kaufmann Publishers Inc., San Francisco, CA. 24, 65

Digital Library

[251]

J. D. Ullman. 1987. Database theory: Past and future. In ACM Symposium on Principles of Database Systems, pp. 1--10. ACM. 34

Digital Library

[252]

J. D. Ullman. 1989. Bottom-up beats top-down for Datalog. In Proc. of the Eighth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, PODS '89, pp. 140--149. ACM. 61

Digital Library

[253]

J. D. Ullman and A. Van Gelder. Nov. 1988. Parallel complexity of logical query programs. Algorithmica, 3(1-4):5--42. 77

Digital Library

[254]

J. Vaghani, K. Ramamohanarao, D. B. Kemp, Z. Somogyi, P. J. Stuckey, T. S. Leask, and J. Harland. Apr. 1994. The Aditi deductive database system. The VLDB Journal, 3(2):245--288. 72

Digital Library

[255]

G. van Emde Boas and P. van Emde Boas. Jan. 1986. Storing and evaluating horn-clause rules in a relational database. IBM Journal of Research and Development, 30(1):80--92. 63

Digital Library

[256]

M. H. Van Emden and R. A. Kowalski. Oct. 1976. The semantics of predicate logic as a programming language. J. ACM, 23(4):733--742. 9, 48

Digital Library

[257]

A. Van Gelder. 1989. Negation as failure using tight derivations for general logic programs. Journal of Logic Programming, 6(1):109--133. 19

Digital Library

[258]

A. Van Gelder, K. A. Ross, and J. S. Schlipf. July 1991. The well-founded semantics for general logic programs. Journal of the ACM, 38(3):619--649. 20, 22

Digital Library

[259]

M. Y. Vardi. 1982. The complexity of relational query languages (extended abstract). In Proc. of the Fourteenth Annual ACM Symposium on Theory of Computing, STOC '82, pp. 137--146. ACM. 77

Digital Library

[260]

M. Y. Vardi. 2016. A theory of regular queries. In T. Milo and W. Tan, editors, Proc. of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, PODS, pp. 1--9. ACM. 64

Digital Library

[261]

J. Vennekens, M. Denecker, and M. Bruynooghe. 2010. FO(ID) as an extension of DL with rules. Ann. Math. Artif. Intell., 58(1-2):85--115. 22

Digital Library

[262]

L. Vieille. 1986. Recursive axioms in deductive databases: The Query/Subquery approach. In Expert Database Conference, pp. 253--267. 60

[263]

L. Vieille. 1987. A database-complete proof procedure based on SLD-resolution. In Proc. of the Fourth International Conference on Logic Programming, pp. 74--103. 60

[264]

L. Vieille. 1998. From data independence to knowledge independence: An on-going story. In Proc. of the 24rd International Conference on Very Large Data Bases, VLDB '98, pp. 650--654. Morgan Kaufmann Publishers Inc., San Francisco, CA. 70

Digital Library

[265]

L. Vieille, P. Bayer, V. Küchenhoff, A. Lefebvre, and R. Manthey. 1992. The EKS-V1 system. In Proc. of the International Conference on Logic Programming and Automated Reasoning, LPAR'92, pp. 504--506. 69

Digital Library

[266]

H. Wan, B. Grosof, M. Kifer, P. Fodor, and S. Liang. July 2009. Logic programming with defaults and argumentation theories. In International Conference on Logic Programming. 36

Digital Library

[267]

J. Wang, M. Balazinska, and D. Halperin. Aug. 2015. Asynchronous and fault-tolerant recursive datalog evaluation in shared-nothing engines. Proc. of the VLDB Endowment, 8(12):1542--1553. 82

Digital Library

[268]

K. Wang and L. Yuan. 1992. Preservation of integrity constraints in definite DATALOG programs. Information Processing Letters, 44(4):185--193. 31

Digital Library

[269]

D. H. D. Warren. 1981. Efficient processing of interactive relational data base queries expressed in logic. In Proc. of the Seventh International Conference on Very Large Data Bases, VLDB '81, pp. 272--281. VLDB Endowment. 12

Digital Library

[270]

D. H. D. Warren. 1982a. Higher-order extensions to Prolog: Are they needed? In J. E. Hayes, D. Michie, and Y.-H. Pao, editors, Machine Intelligence, vol. 10, pp. 441--454. Halsted Press. 37

[271]

D. H. D. Warren. 1982b. A view of the Fifth Generation and its impact. AI Magazine, 3(4):34. 12

[272]

D. H. D. Warren and F. C. N. Pereira. July 1982. An efficient easily adaptable system for interpreting natural language queries. Computational Linguistics, 8(3-4):110--122.12

Digital Library

[273]

D. S. Warren. Mar. 1992. Memoing for logic programs. Commun. ACM, 35(3):93--111. 54

Digital Library

[274]

D. S. Warren, T. Swift, and K. F. Sagonas. Mar. 2007. The XSB Programmer's Manual, Version 2.7.1. Technical report, Department of Computer Science, State University of New York at Stony Brook, Stony Brook, NY. The XSB System is available from xsb.sourceforge.net, and the system and manual is continually updated. 59, 71

[275]

T. Winograd. 1975. Frame Representations and the Procedural-Declarative Controversy. In D. Bobrow and A. Collins, editors, Representation and Understanding: Studies in Cognitive Science, pp. 185--210. Academic Press. 14

[276]

G. Yang, M. Kifer, and C. Zhao. Nov. 2003. FLORA-2: A rule-based knowledge representation and inference infrastructure for the Semantic Web. In International Conference on Ontologies, Databases and Applications of Semantics (ODBASE-2003), vol. 2888 of Lecture Notes in Computer Science, pp. 671--688. Springer. 34, 38, 46, 91

[277]

M. Yang, A. Shkapsky, and C. Zaniolo. Apr. 2017. Scaling up the performance of more powerful Datalog systems on multicore machines. The VLDB Journal, 26(2):229--248. 83

Digital Library

[278]

C. Zaniolo. 1986. Prolog: A database query language for all seasons. In Proc. from the First International Workshop on Expert Database Systems, pp. 219--232. Benjamin-Cummings Publishing Co., Inc., Redwood City, CA. 12

Digital Library

[279]

C. Zaniolo. 1988. Design and implementation of a logic based language for data intensive applications. In Proc. of the Fifth International Conference and Symposium on Logic Programming, pp. 1666--1687. 65

[280]

C. Zaniolo. 1993. A unified semantics for active and deductive databases. In Proc. of the Workshop on Rules in Database Systems, Workshops in Computing. Springer-Verlag. 41

[281]

C. Zaniolo. 2002. Key constraints and monotonic aggregates in deductive databases. In Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part II, pp. 109--134. Springer-Verlag, London, UK. 25

Digital Library

[282]

C. Zaniolo and H. Wang. 1999. Logic-based user-defined aggregates for the next generation of database systems. In The Logic Programming Paradigm: A 25-Year Perspective, pp. 401--426. Springer Berlin Heidelberg, Berlin, Heidelberg. 25

[283]

C. Zaniolo, N. Arni, and K. Ong. Dec. 1993. Negation and aggregates in recursive rules: The LDL++ approach. In Proc. of the Third International Conference on Deductive and Object-Oriented Databases (DOOD), pp. 204--221. Springer-Verlag, Lecture Notes in Computer Science 760. 24

[284]

C. Zaniolo, S. Ceri, C. Faloutsos, R. T. Snodgrass, V. S. Subrahmanian, and R. Zicari. 1997. Advanced Database Systems. Morgan Kaufmann, San Francisco, CA. 42

Digital Library

[285]

C. Zaniolo, M. Yang, A. Das, A. Shkapsky, T. Condie, and M. Interlandi. 2017. Fixpoint semantics and optimization of recursive Datalog programs with aggregates. TPLP, 17(5-6):1048--1065. 83

[286]

N. Zhou, Y. Shen, L. Yuan, and J. You. 2001. Implementation of a linear tabling mechanism. Journal of Functional and Logic Programming, 2001(10). 59

[287]

D. Zook, E. Pasalic, and B. Sarna-Starosta. 2009. Typed Datalog. In Proc. of the 11th International Symposium on Practical Aspects of Declarative Languages, PADL '09, pp. 168--182. Springer-Verlag, Berlin, Heidelberg. 31

Digital Library

Cited By

Sun YShovon AGilray TKumar SMicinski KEeckhout LSmaragdakis GLiang KSampson AKim MRossbach C(2025)Optimizing Datalog for the GPUProceedings of the 30th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, Volume 110.1145/3669940.3707274(762-776)Online publication date: 30-Mar-2025
https://dl.acm.org/doi/10.1145/3669940.3707274
Chlyah SGesbert NGenevès PLayaïda N(2025)Efficient Iterative Programs with Distributed Data CollectionsJournal of Logical and Algebraic Methods in Programming10.1016/j.jlamp.2025.101047(101047)Online publication date: Feb-2025
https://doi.org/10.1016/j.jlamp.2025.101047
Klopp DErdweg SPacak A(2024)Object-Oriented Fixpoint Programming with DatalogProceedings of the ACM on Programming Languages10.1145/36897138:OOPSLA2(60-86)Online publication date: 8-Oct-2024
https://dl.acm.org/doi/10.1145/3689713
Show More Cited By

Datalog: concepts, history, and outlook

Recommendations

Datalog LITE: a deductive query language with linear time model checking

We present Datalog LITE, a new deductive query language with a linear-time model-checking algorithm, that is, linear time data complexity and program complexity. Datalog LITE is a variant of Datalog that uses stratified negation, restricted variable ...
Disjunctive datalog

We consider disjunctive Datalog, a powerful database query language based on disjunctive logic programming. Briefly, disjunctive Datalog is a variant of Datalog where disjunctions may appear in the rule heads; advanced versions also allow for negation in ...
On temporal logic versus datalog
Logic and complexity in computer science

We provide a direct and modular translation from the temporal logics CTL, ETL, FCTL (CTL extended with the ability to express fairness) and the Modal µ-calculus to Monadic inf-Datalog with built-in predicates. We call it inf-Datalog because the ...

Comments

Information & Contributors

Information

Published In

cover image ACM Books

Declarative Logic Programming: Theory, Systems, and Applications

September 2018

615 pages

ISBN:9781970001990

DOI:10.1145/3191315

Editors:
Michael Kifer
Stony Brook University
,
Yanhong Annie Liu
Stony Brook University

Publisher

Association for Computing Machinery and Morgan & Claypool

Publication History

Published: 01 September 2018

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Chapter

Appears in

ACM Books

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

24
Total Citations
View Citations
231
Total Downloads

Downloads (Last 12 months)56
Downloads (Last 6 weeks)11

Reflects downloads up to 05 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

Sun YShovon AGilray TKumar SMicinski KEeckhout LSmaragdakis GLiang KSampson AKim MRossbach C(2025)Optimizing Datalog for the GPUProceedings of the 30th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, Volume 110.1145/3669940.3707274(762-776)Online publication date: 30-Mar-2025
https://dl.acm.org/doi/10.1145/3669940.3707274
Chlyah SGesbert NGenevès PLayaïda N(2025)Efficient Iterative Programs with Distributed Data CollectionsJournal of Logical and Algebraic Methods in Programming10.1016/j.jlamp.2025.101047(101047)Online publication date: Feb-2025
https://doi.org/10.1016/j.jlamp.2025.101047
Klopp DErdweg SPacak A(2024)Object-Oriented Fixpoint Programming with DatalogProceedings of the ACM on Programming Languages10.1145/36897138:OOPSLA2(60-86)Online publication date: 8-Oct-2024
https://dl.acm.org/doi/10.1145/3689713
Esterhuyse Cvan Binsbergen LLaemmel RPereira JMosses P(2024)Cooperative Specification via Composition ControlProceedings of the 17th ACM SIGPLAN International Conference on Software Language Engineering10.1145/3687997.3695635(2-15)Online publication date: 17-Oct-2024
https://dl.acm.org/doi/10.1145/3687997.3695635
Abo Khamis MNgo HPichler RSuciu DWang Y(2024)Convergence of datalog over (Pre-) SemiringsJournal of the ACM10.1145/364302771:2(1-55)Online publication date: 10-Apr-2024
https://dl.acm.org/doi/10.1145/3643027
Puyt RLie FMadsen D(2024)From SOFT approach to SWOT analysis, a historical reconstructionJournal of Management History10.1108/JMH-05-2023-004731:2(333-373)Online publication date: 18-Jun-2024
https://doi.org/10.1108/JMH-05-2023-0047
Wang SZhao X(2024)Contractsentry: a static analysis tool for smart contract vulnerability detectionAutomated Software Engineering10.1007/s10515-024-00471-832:1Online publication date: 23-Oct-2024
https://doi.org/10.1007/s10515-024-00471-8
Wenzel JKöhl MSterz SZhang HSchmidt AFetzer CHermanns H(2024)Traceability and Accountability by ConstructionLeveraging Applications of Formal Methods, Verification and Validation. Software Engineering Methodologies10.1007/978-3-031-75387-9_16(258-280)Online publication date: 27-Oct-2024
https://dl.acm.org/doi/10.1007/978-3-031-75387-9_16
Chen HZhao XWang YZhen Z(2024)SafeCheckSecurity and Privacy10.1002/spy2.3937:5Online publication date: 11-Mar-2024
https://dl.acm.org/doi/10.1002/spy2.393
Pacak AErdweg S(2023)Interactive Debugging of Datalog ProgramsProceedings of the ACM on Programming Languages10.1145/36228247:OOPSLA2(745-772)Online publication date: 16-Oct-2023
https://dl.acm.org/doi/10.1145/3622824
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Chapter

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten