Declarative Logic Programming - Michael Kifer ACM Books

Скачать книгу

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

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

      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

      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, New York. 13, 19

      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

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

      J. Paredaens. 1978. On the expressive power of the relational algebra. Information Processing Letters, 7(2):107–111. DOI: 10.1016/0020-0190(78)90055-8. 13

      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. DOI: 10.1017/S1471068406002973. 24

      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. DOI: 10.1145/1242572.1242679. 76

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

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

      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. DOI: 10.1016/B978-0-934613-40-8.50009-9. 20

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

      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. DOI: 10.1145/73721.73723. 20

      F. Puppe. 1993. Characterization and history of expert systems. In Systematic Introduction to Expert Systems, pp. 3–8. Springer. DOI: 10.1007/978-3-642-77971-8_1. 14

      R. Ramakrishnan. Oct./Nov. 1991. Magic templates: A spellbinding approach to logic programs. Journal of Logic Programming, 11(3-4):189–216. DOI: 10.1016/0743-1066(91)90026-L. 51, 68

      R. Ramakrishnan and J. D. Ullman. 1995. A survey of deductive database systems. Journal of Logic Programming, 23(2):125–149. DOI: 10.1016/0743-1066(94)00039-9. 65

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

      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

      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. DOI: 10.1007/978-1-4684-3384-5_6. 13, 63

      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

      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

      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

      M. Rezk and M. Kifer. 2012. Transaction Logic with partially defined actions. Journal of Data Semantics, 1(2):99–131. DOI: 10.1007/s13740-012-0007-8. 46

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

      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

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

      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. DOI: 10.1145/137097.137852. 25

      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. DOI: 10.1007/3-540-17187-8_28. 51, 66

      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. DOI: 10.1145/6012.6013. 51

      Y. Sagiv. 1987. Optimizing Datalog programs. In Proc. of the Sixth ACM SIGACT-SIGMODSIGART Symposium on Principles of Database Systems, PODS ’87, pp. 349–362. ACM. DOI: 10.1145/28659.28696. 32, 64

      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. DOI: 10.1145/191839.191927. 71, 85

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

      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

      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. DOI: 10.14778/2536274.2536290. 65, 83

      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. DOI: 10.1145/2882903.2915229. 83

      O. Shmueli. 1993. Equivalence of DATALOG queries is undecidable. J. Log. Program., 15(3):231–241. DOI: 10.1016/0743-1066(93)90040-N. 64

      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. DOI: 10.1007/978-3-642-24206-9_14. 79, 80

      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. DOI: 10.1007/3-540-61511-3_110. 42

      T. Swift

Скачать книгу