Declarative Logic Programming. Michael Kifer
Читать онлайн книгу.
VLDB ’86, pp. 91–100. Morgan Kaufmann Publishers Inc., San Francisco, CA. 68
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
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
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
S. Ceri, G. Gottlob, and G. Wiederhold. Feb. 1989. Efficient database access from Prolog. IEEE Trans. on Software Engineering, 15(2):153–164. DOI: 10.1109/32.21742. 63
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. DOI: 10.1145/78922.78924. 31
A. Chandra and D. Harel. Apr. 1985. Horn clause queries and generalizations. Journal of Logic Programming, 2(1):1–15. DOI: 10.1016/0743-1066(85)90002-0. 77
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. DOI: 10.1007/978-1-4684-3384-5_8. 13, 63
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
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. DOI: 10.1006/jcss.1997.1452. 64
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. DOI: 10.1145/73721.73757. 33
W. Chen and D. S. Warren. Jan. 1996. Tabled evaluation with delaying for general logic programs. JACM, 43(1):20–74. DOI: 10.1145/227595.227597. 21, 59, 71
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
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
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. DOI: 10.1016/0743-1066(93)90039-J. 37, 38
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. DOI: 10.1109/69.50907. 66
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
J. Chomicki. 1990. Polynomial time query processing in temporal deductive databases. In ACM Symposium on Principles of Database Systems, pp. 379–391. DOI: 10.1145/298514.298589. 41
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
Coherent Knowledge LLC, 2017. Ergo Suite. Available at: http://coherentknowledge.com/. 28, 34, 38
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. DOI: 10.1145/154766.155362. 11
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. DOI: 10.1145/2391229.2391230. 25
C. Cornelio, A. Loreggia, and V. Saraswat. 2015. Logical conditional preference theories. Technical report, T.J. Watson Research Center. arXiv preprint: 1504.06374. 24
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. DOI: 10.1145/62212.62259. 64
V. S. Costa, R. Rocha, and L. Damas. 2012. The YAP Prolog system. Theory and Practice of Logic Programming, 12(1-2):5–34. DOI: 10.1017/S1471068411000512. 52
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. DOI: 10.1016/B978-1-4832-1313-2.50018-4. 63
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. DOI: 10.1007/978-1-4471-4739-8_11. 28
V. Dahl. Mar. 1982. On database systems development through logic. ACM Trans. on Database Systems, 7(1):102–123. DOI: 10.1145/319682.319700. 14
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
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. DOI: 10.1145/502807.502810. 77
R. Davis. Feb. 1986. Knowledge-based systems. Science, 231(4741):957–964. 14
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. DOI: 10.1109/SCAM.2007.31. 79, 80
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
H. Decker. 1986. Integrity enforcement on deductive databases. In Proc. of the Expert Database Conference, pp. 381–395. 31
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
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. DOI: 10.1145/383779.383789. 22
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. DOI: 10.1007/BF01228879. 68
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. DOI: 10.1145/1376916.1376938. 26, 27
S. W. Dietrich. 1987. Extension tables: Memo relations in logic programming. In Proc. of the 1987 Symposium on Logic Programming,