Declarative Logic Programming. Michael Kifer

Чтение книги онлайн.

СКАЧАТЬ 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 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

      H. Tamaki and T. Sato. 1986. OLD resolution with tabulation. In Third International Conference on Logic Programming, pp. 84–98. DOI: 10.1007/3-540-16492-8_66. 59

      P. Tarau. 2004. Agent-oriented logic programming constructs in Jinni. In International Conference on Logic Programming, vol. 3132 of Lecture Notes in Computer Science. DOI: 10.1007/978-3-540-27775-0_46. 33

      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. DOI: 10.1145/1836089.1836094. 52, 58, 61, 93

      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. DOI: 10.1145/1989323.1989393. 52, 58, 61

      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

      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. DOI: 10.1007/978-3-540-79980-1_26. 24, 65

      J. D. Ullman. 1987. Database theory: Past and future. In ACM Symposium on Principles of Database Systems, pp. 1–10. ACM. DOI: 10.1145/28659.28660. 34

      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. DOI: 10.1145/73721.73736. 61

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

      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. DOI: 10.1007/BF01228882. 72

      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. DOI: 10.1147/rd.301.0080. 63

      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. DOI: 10.1145/321978.321991. 9, 48

      A. Van Gelder. 1989. Negation as failure using tight derivations for general logic programs. Journal of Logic Programming, 6(1):109–133. DOI: 10.1016/0743-1066(89)90032-0. 19

      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. DOI: 10.1145/116825.116838. 20, 22

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

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

      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

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

      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

      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

      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. DOI: 10.1007/BFb0013102. 69

      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. DOI: 10.1007/978-3-642-02846-5_35. 36

      J. СКАЧАТЬ