Declarative Logic Programming. Michael Kifer

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

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

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

      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. DOI: 10.1016/j.artint.2008.04.002. 78

      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. DOI: 10.1007/978-3-540-30504-0_7. 78

      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. DOI: 10.1137/S0097539794266766. 77

      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. DOI: 10.1147/rd.294.0413. 14

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

      P. Fodor and M. Kifer. July 2011. Transaction Logic with defaults and argumentation theories. In International Conference on Logic Programming, pp. 162–174. DOI: 10.4230/LIPIcs.ICLP.2011.162. 45

      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. DOI: 10.1145/38714.38743. 69

      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

      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

      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

      J. Frohn, R. Himmerö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

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

      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. DOI: 10.1007/BF03037455. 12

      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. DOI: 10.14778/2733085.2733091. 83

      F. Furfaro, S. Greco, S. Ganguly, and C. Zaniolo. 2002. Pushing extrema aggregates to optimize logic queries. Information Systems, 27(5):321–343. DOI: 10.1016/S0306-4379(02)00006-6. 82

      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. DOI: 10.1145/174130.174142. 64

      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.

      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.

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

      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

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

      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

      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. DOI: 10.1145/962446.962450. 77

      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. DOI: 10.1007/3-540-48242-3_13. 77

      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. DOI: 10.1109/69.43410. 60

      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 Twentythird ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS ’04, pp. 1–12. ACM. DOI: 10.1145/1055558.1055560. 83

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

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

      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. DOI: 10.1007/978-1-4615-8297-7_8. 63

      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. DOI: 10.1016/j.websem.2008.05.001. 78

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

      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. DOI: 10.1145/800186.810578. 13

      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

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

      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. DOI: 10.1007/3-540-45635-X_20. 59

      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. DOI: 10.1145/67544.66962. 73

      C.