Declarative Logic Programming. Michael Kifer
Читать онлайн книгу.
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. 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. DOI: 10.14778/2824032.2824052. 82
K. Wang and L. Yuan. 1992. Preservation of integrity constraints in definite DATALOG programs. Information Processing Letters, 44(4):185–193. DOI: 10.1016/0020-0190(92)90083-8. 31
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
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
D. H. D. Warren. 1982b. A view of the Fifth Generation and its impact. AI Magazine, 3(4):34. 12
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
D. S. Warren. Mar. 1992. Memoing for logic programs. Commun. ACM, 35(3):93–111. DOI: 10.1145/131295.131299. 54
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
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. DOI: 10.1016/B978-0-12-108550-6.50012-4. 14
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. DOI: 10.1007/978-3-540-39964-3_43. 34, 38, 46, 91
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. DOI: 10.1007/s00778-016-0448-z. 83
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
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
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. DOI: 10.1007/978-1-4471-3225-7_16. 41
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,