Fifty years of Prolog and beyond. (English) Zbl 1541.68071
Summary: Both logic programming in general and Prolog in particular have a long and fascinating history, intermingled with that of many disciplines they inherited from or catalyzed. A large body of research has been gathered over the last 50 years, supported by many Prolog implementations. Many implementations are still actively developed, while new ones keep appearing. Often, the features added by different systems were motivated by the interdisciplinary needs of programmers and implementors, yielding systems that, while sharing the “classic” core language, in particular, the main aspects of the ISO-Prolog standard, also depart from each other in other aspects. This obviously poses challenges for code portability. The field has also inspired many related, but quite different languages that have created their own communities. This article aims at integrating and applying the main lessons learned in the process of evolution of Prolog. It is structured into three major parts. First, we overview the evolution of Prolog systems and the community approximately up to the ISO standard, considering both the main historic developments and the motivations behind several Prolog implementations, as well as other logic programming languages influenced by Prolog. Then, we discuss the Prolog implementations that are most active after the appearance of the standard: their visions, goals, commonalities, and incompatibilities. Finally, we perform a SWOT analysis in order to better identify the potential of Prolog and propose future directions along with which Prolog might continue to add useful features, interfaces, libraries, and tools, while at the same time improving compatibility between implementations.
Software:
SATCHMO; Gringo; tuProlog; CHIP; ReSpecT; Smodels; Prolog; SWISH DataLab; clpfd; HYPROLOG; sCASP; Rust; ProB; SICStus; wamcc; iClingo; BERT; Ciao; CiaoPP; GitHub; leanTAP; OPTYap; PTTP; Mercury; WASP; MiniZinc; ProbLog; YAP-Prolog; NQTHM; SWI-Prolog; VeriFly; B-Prolog; Curry; Clingo; XSB; PARLOG; clasp; 2P-Kt; PRISM; GHCReferences:
| [1] | Abramson, H. and Dahl, V.1989. Logic Grammars. Springer. · Zbl 0672.68032 |
| [2] | Abreu, S. and Diaz, D.2003. Objective: In minimum context. In Proceedings ICLP, C. Palamidessi, Ed. Lecture Notes in Computer Science, vol. 2916. Springer, 128-147. |
| [3] | Abreu, S. and Nogueira, V.2005. Using a logic programming language with persistence and contexts. In Procedings INAP, M. Umeda, A. Wolf, O. Bartenstein, U. Geske, D. Seipel and O. Takata, Eds. Lecture Notes in Computer Science, vol. 4369. Springer, 38-47. |
| [4] | Adebara, I. and Dahl, V.2016. Grammar induction as automated transformation between constraint solving models of language. In Proceedings KnowProS, R. Bartak, T. L. McCluskey and E. Pontelli, Eds. CEUR Workshop Proceedings, vol. 1648. CEUR. |
| [5] | Aít-Kaci, H.1991. Warren’s Abstract Machine: A Tutorial Reconstruction. MIT Press. |
| [6] | Aít-Kaci, H.1993. An introduction to LIFE - Programming with logic, inheritance, functions and equations. In Proceedings ILPS, D. Miller, Ed. MIT Press, 52-68. |
| [7] | Aít-Kaci, H., Dumant, B., Meyer, R., Podelski, A. and Roy, P. V.1994. The Wild LIFE Handbook. Digital Paris Research Laboratory. Prepublication Edition. |
| [8] | Aít-Kaci, H. and Podelski, A.1991. Towards a meaning of LIFE. In Proceedings PLILP, J. Maluszyński and M. Wirsing, Eds. LNCS, vol. 528. Springer, 255-274. · Zbl 0801.68018 |
| [9] | Akers, S. B.1978. Binary decision diagrams. IEEE Transactions on Computers 27, 6, 509-516. · Zbl 0377.94038 |
| [10] | Ali, K. A. and Karlsson, R.1990. The Muse approach to OR-parallel Prolog. International Journal of Parallel Programming 19, 2, 129-162. |
| [11] | Alpuente, M., Feliú, M. A., Joubert, C. and Villanueva, A.2010. Datalog-based program analysis with BES and RWL. In Proceedings Datalog 2.0 Workshop, O. de Moor, G. Gottlob, T. Furche and A. J. Sellers, Eds. Lecture Notes in Computer Science, vol. 6702. Springer, 1-20. |
| [12] | Alviano, M., Dodaro, C., Faber, W., Leone, N. and Ricca, F.2013. WASP: A native ASP solver based on constraint learning. In Proceedings LPNMR, P. Cabalar and T. C. Son, Eds. Lecture Notes in Computer Science, vol. 8148. Springer, 54-66. |
| [13] | Angelopoulos, N., Costa, V. S., Azevedo, J., Wielemaker, J., Camacho, R. and Wessels, L. F. A.2013. Integrative functional statistics in logic programming. In Proceedings PADL, K. Sagonas, Ed. Lecture Notes in Computer Science, vol. 7752. Springer, 190-205. |
| [14] | Angelopoulos, N. and Wielemaker, J.2019. Advances in big data bio analytics. In Proceedings ICLP (Technical Communications), B. Bogaerts, E. Erdem, P. Fodor, A. Formisano, G. Ianni, D. Inclezan, G. Vidal, A. Villanueva, M. D. Vos and F. Yang, Eds. EPTCS, vol. 306. CoRR, 309-322. |
| [15] | Antoy, S. and Hanus, M.2010. Functional logic programming. Communications of the ACM 53, 4, 74-85. |
| [16] | Apt, K. and Wallace, M.2007. Constraint Logic Programming Using ECLiPSe. Cambridge University Press. · Zbl 1119.68044 |
| [17] | Apt, K. R.2001. Viewpoint: One more revolution to make: Free Scientific Publishing. Communications of the ACM 44, 5, 25-28. |
| [18] | Arias, J. and Carro, M.2016. Description and evaluation of a generic design to integrate CLP and tabled execution. In Proceedings PPDP. ACM, 10-23. |
| [19] | Arias, J., Carro, M., Salazar, E., Marple, K. and Gupta, G.2018. Constraint answer set programming without grounding. Theory and Practice of Logic Programming 18, 3-4, 337-354. · Zbl 1451.68063 |
| [20] | Armstrong, J.2007. A history of Erlang. In Proceedings HOPL. ACM, 1-26. |
| [21] | Prolog Updates Note, B2021. URL: http://www.picat-lang.org/bprolog/updates.html. [Accessed on 11 March, 2022]. |
| [22] | Bagnara, R.1999. Is the ISO Prolog standard taken seriously? Association for Logic Programming Newsletter 12, 1, 10-12. |
| [23] | Bagnara, R. and Carro, M.2002. Foreign language interfaces for Prolog: A terse survey. Association for Logic Programming Newsletter 15, 2. |
| [24] | Basilio, R., Zaverucha, G. and Carneiro Barbosa, V.2001. Learning logic programs with neural networks. In Proceedings ILP, C. Rouveirol and M. Sebag, Eds. Lecture Notes in Computer Science, vol. 2157. Springer, 15-26. · Zbl 1006.68513 |
| [25] | Baumeister, J. and Seipel, D.2010. Anomalies in ontologies with rules. Journal of Web Semantics 8, 1, 55-68. |
| [26] | Bavarian, M. and Dahl, V.2006. Constraint based methods for biological sequence analysis. Journal of Universal Computer Science 12, 1500-1520. |
| [27] | Beckert, B. and Posegga, J.1995. leanTAP: Lean tableau-based deduction. Journal of Automated Reasoning 15, 3, 339-358. · Zbl 0838.68097 |
| [28] | Becket, R. and Somogyi, Z.2008. DCGs + memoing = Packrat parsing but is it worth it? In Proceedings PADL, P. Hudak and D. S. Warren, Eds. Lecture Notes in Computer Science, vol. 4902. Springer, 182-196. |
| [29] | Beldiceanu, N. and Contejean, E.1994. Introducing global constraints in CHIP. Mathematical and computer Modelling 20, 12, 97-123. · Zbl 0816.68048 |
| [30] | Bender, E. M. and Koller, A.2020. Climbing towards NLU: On meaning, form, and understanding in the age of data. In Proceedings ACL. Association for Computational Linguistics, 5185-5198. |
| [31] | Benichou, M., Beringer, H., Gauthier, J.-M. and Beierle, C.1992. Prolog at IBM: An advanced and evolving application development technology. IBM Systems Journal 31, 4, 755-773. |
| [32] | Birhane, A.2021. Algorithmic injustice: A relational ethics approach. Patterns 2, 2, 100205. |
| [33] | Blackburn, P., Bos, J. and Striegnitz, K.2006. Learn Prolog Now! Vol. 7. College Publications Londres. · Zbl 1192.68117 |
| [34] | Bogaard, T., Wielemaker, J., Hollink, L. and Van Ossenbruggen, J.2016. SWISH DataLab: A web interface for data exploration and analysis. In Proceedings BNAIC, T. Bosse and B. Bredeweg, Eds. Communications in Computer and Information Science, vol. 765. Springer, 181-187. |
| [35] | Boizumault, P.1986. A general model to implement DIF and FREEZE. In Proceedings ICLP, E. Shapiro, Ed. Lecture Notes in Computer Science, vol. 225. Springer, 585-592. |
| [36] | Bolz, C. F., Cuni, A., Fijalkowski, M., Leuschel, M., Pedroni, S. and Rigo, A.2011. Allocation removal by partial evaluation in a tracing JIT. In Proceedings PEPM. ACM, 43-52. |
| [37] | Bonatti, P. A.2001. Resolution for skeptical stable model semantics. Journal of Automated Reasoning 27, 4, 391-421. · Zbl 0991.03016 |
| [38] | Bonatti, P. A.2010. Datalog for security, privacy and trust. In Proceedings Datalog 2.0 Workshop, O. de Moor, G. Gottlob, T. Furche and A. J. Sellers, Eds. Lecture Notes in Computer Science, vol. 6702. Springer, 21-36. |
| [39] | Bonatti, P. A., Pontelli, E. and Son, T. C.2008. Credulous resolution for answer set programming. In Proceedings AAAI, D. Fox and C. P. Gomes, Eds. AAAI Press, 418-423. |
| [40] | Bone, P., Somogyi, Z. and Schachte, P.2012. Controlling loops in parallel mercury code. In Proceedings DAMP. ACM, 11-20. |
| [41] | Börger, E. and Rosenzweig, D.1995. The WAM - Definition and compiler correctness. In Logic Programming: Formal Methods and Practical Applications, C. Beierle and L. PlÜmer, Eds. Studies in Computer Science and Artificial Intelligence, vol. 11. Elsevier/North-Holland, 20-90. · Zbl 0832.68024 |
| [42] | Bowen, D., Byrd, L. and Clocksin, W.1983. A portable Prolog compiler. In Proceedings Logic Programming Workshop, L. M. Pereira, A. Porto, L. Monteiro and M. Filgueiras, Eds. De Lisboa, Universidade Nova. Núcleo de Intelegência Artificial., 74-83. |
| [43] | Boyer, R. and Moore, J.1972. The sharing structure in theorem-proving programs. Machine Intelligence 7, 101-116. · Zbl 0249.68032 |
| [44] | BProlog Homepage2021. B-PROLOG. URL: http://www.picat-lang.org/bprolog. [Accessed on 11 March, 2022]. |
| [45] | Bratko, I.2012. Prolog Programming for Artificial Intelligence, 4th ed. Addison-Wesley. · Zbl 0599.68007 |
| [46] | Brewka, G., Eiter, T. and Truszczyński, M.2011. Answer set programming at a glance. Communications of the ACM 54, 12, 92-103. |
| [47] | Brewka, G., Eiter, T. and Truszczynski, M.2016. Answer set programming: An introduction to the special issue. AI Magazine 37, 3, 5-6. |
| [48] | Bruynooghe, M.1976. An Interpreter for Predicate Logic Programs. Part I: Basic Principles. Tech. Rep. CW 10, Department of Computer Science, KU Leuven. URL: https://lirias.kuleuven.be/retrieve/522231. |
| [49] | Bruynooghe, M.2021. Prolog Documents. URL: https://people.cs.kuleuven.be/ Maurice.Bruynooghe/Prolog/Prolog.html. [Accessed 11 March, 2022]. |
| [50] | Bueno, F., García De La Banda, M. and Hermenegildo, M. V.1999. Effectiveness of abstract interpretation in automatic parallelization: A case study in logic programming. Transactions on Programming Languages and Systems 21, 2, 189-238. |
| [51] | Bugliesi, M., Lamma, E. and Mello, P.1994. Modularity in logic programming. Journal of Logic Programming 19/20, 443-502. |
| [52] | Byrd, L.1980. Understanding the control flow of Prolog programs. In Proceedings Logic Programing Workshop, S. Åke Tärnlund, Ed., 127-138. |
| [53] | Cabeza, D. and Hermenegildo, M. V.1996. Implementing distributed concurrent constraint execution in the CIAO system. In Procedings APPIA-GULP-PRODE, 67-78. |
| [54] | Cabeza, D. and Hermenegildo, M. V.2000. A new module system for Prolog. In Proceedings CL, J. Lloyd, V. Dahl, U. Furbach, M. Kerber, K.-K. Lau, C. Palamidessi, L. M. Pereira, Y. Sagiv and P. J. Stuckey, Eds. Lecture Notes in Computer Science, vol. 1861. Springer, 131-148. · Zbl 0983.68598 |
| [55] | Calegari, R., Ciatto, G., Dellaluce, J. and Omicini, A.2019. Interpretable narrative explanation for ML predictors with LP: A case study for XAI. In Proceedings WOA 2019, F. Bergenti and S. Monica, Eds. CEUR Workshop Proceedings, vol. 2404. CEUR, 105-112. |
| [56] | Calegari, R., Ciatto, G., Denti, E. and Omicini, A.2020. Logic-based technologies for intelligent systems: State of the art and perspectives. Information 11, 3, 1-29. |
| [57] | Calegari, R., Ciatto, G., Mariani, S., Denti, E. and Omicini, A.2018. LPaaS as micro-intelligence: Enhancing IoT with symbolic reasoning. Big Data and Cognitive Computing 2, 3. |
| [58] | Calegari, R., Ciatto, G., Mascardi, V. and Omicini, A.2021. Logic-based technologies for multi-agent systems: A systematic literature review. Autonomous Agents and Multi-Agent Systems 35, 1, 1:1-1:67. |
| [59] | Calegari, R., Ciatto, G. and Omicini, A.2020. On the integration of symbolic and sub-symbolic techniques for XAI: A survey. Intelligenza Artificiale 14, 1, 7-32. |
| [60] | Carlson, B., Carlsson, M. and Diaz, D.1994. Entailment of finite domain constraints. In Proceedings ICLP, P. V. Hentenryck, Ed. MIT Press, 339-353. |
| [61] | Carlsson, M.1984. On Implementing Prolog in functional programming. New Generation Computing 2, 4, 347-359. |
| [62] | Carlsson, M.1986. SICStus: Preliminary Specification. Draft. |
| [63] | Carlsson, M. and Mildner, P.2012. SICStus Prolog – the first 25 years. Theory and Practice of Logic Programming 12, 1-2, 35-66. · Zbl 1244.68016 |
| [64] | Carro, M. and Hermenegildo, M.1999. Concurrency in Prolog using threads and a shared database. In Proceedings ICLP, D. D. Schreye, Ed. MIT Press, 320-334. |
| [65] | Carro, M., Morales, J., Muller, H., Puebla, G. and Hermenegildo, M. V.2006. High-level languages for small devices: A case study. In Proceedings CASES, K. Flautner and T. Kim, Eds. ACM Press/Sheridan, 271-281. |
| [66] | Chen, W. and Warren, D. S.1996. Computation of stable models and its integration with logical query processing. IEEE Transactions on Knowledge and Data Engineering 8, 5, 742-757. |
| [67] | Chirico, U.2021. JIProlog-java internet Prolog. URL: http://www.jiprolog.com/. [Accessed 11 March, 2022]. |
| [68] | Christiansen, H.2002. Logical grammars based on constraint handling rules. In Proceedings ICLP, P. J. Stuckey, Ed. Lecture Notes in Computer Science, vol. 2401. Springer, 481. · Zbl 1045.68612 |
| [69] | Christiansen, H. and Dahl, V.2005. HYPROLOG: A new logic programming language with assumptions and abduction. In Proceedings ICLP, M. Gabbrielli and G. Gupta, Eds. Lecture Notes in Computer Science, vol. 3668. Springer, 159-173. · Zbl 1165.68327 |
| [70] | Christiansen, H. and Dahl, V.2018. Natural language processing with (tabled and constraint) logic programming. In Declarative Logic Programming: Theory, Systems, and Applications, M. Kifer and Y. A. Liu, Eds. ACM, 477-511. |
| [71] | Ciao Prolog Homepage2021. The Ciao programming language. URL: https://ciao-lang.org. [Accessed 11 March, 2022]. |
| [72] | Ciatto, G., Calegari, R., Mariani, S., Denti, E. and Omicini, A.2018. From the Blockchain to logic programming and back: Research perspectives. In Proceedings WOA 2018, M. Cossentino, L. Sabatucci and V. Seidita, Eds. CEUR Workshop Proceedings, vol. 2215. CEUR, 69-74. |
| [73] | Ciatto, G., Calegari, R. and Omicini, A.2021a. 2P-Kt: A logic-based ecosystem for symbolic AI. SoftwareX 16, 100817, 1-7. |
| [74] | Ciatto, G., Calegari, R. and Omicini, A.2021b. Lazy stream manipulation in Prolog via backtracking: The case of 2P- Kt. In Proceedings JELIA 2021, W. Faber, G. Friedrich, M. Gebser and M. Morak, Eds. Notes, Lecture in Computer Science, vol. 12678. Springer, 407-420. · Zbl 07437055 |
| [75] | Ciatto, G., Calegari, R., Siboni, E., Denti, E. and Omicini, A.2020. 2P-Kt: Logic programming with objects & functions in Kotlin. In Proceedings WOA 2020, R. Calegari, G. Ciatto, E. Denti, A. Omicini and G. Sartor, Eds. CEUR Workshop Proceedings, vol. 2706. CEUR, 219-236. |
| [76] | Ciatto, G., Maffi, A., Mariani, S. and Omicini, A.2019. Towards agent-oriented Blockchains: Autonomous smart contracts. In Proceedings PAAMS, Y. Demazeau, E. Matson, J. M. Corchado and F. De la Prieta, Eds. Notes, Lecture in Computer Science, vol. 11523. Springer, 29-41. |
| [77] | Ciatto, G., Mariani, S., Omicini, A. and Zambonelli, F.2020. From agents to Blockchain: Stairway to integration. Applied Sciences 10, 21, 7460:1-7460:22. |
| [78] | Ciatto, G., Schumacher, M. I., Omicini, A. and Calvaresi, D.2020. Agent-based explanations in AI: Towards an abstract framework. In Proceedings EXTRAAMAS, D. Calvaresi, A. Najjar, M. Winikoff and K. Främling, Eds. Notes, Lecture in Computer Science, vol. 12175. Springer, 3-20. |
| [79] | Clark, K. and Gregory, S.1986. PARLOG: Parallel programming in logic. Transactions on Programming Languages and Systems 8, 1, 1-49. · Zbl 0592.68016 |
| [80] | Clark, K. L.1978. Negation as failure. In Logic and Data Bases, H. Gallaire and J. Minker, Eds. Springer, 293-322. |
| [81] | Clocksin, W.1997. Clause and Effect. Springer. · Zbl 0887.68011 |
| [82] | Clocksin, W. F. and Mellish, C.1981. Programming in Prolog. Springer. · Zbl 0466.68009 |
| [83] | Homepage, Clojure2021. Clojure. URL: https://clojure.org/. [Accessed 11 March, 2022]. |
| [84] | CMU Artificial Intelligence Repository. 1995. SB-Prolog: Stony Brook Prolog v.3.1.01. URL: https://www.cs.cmu.edu/afs/cs/project/ai-repository/ai/lang/prolog/impl/prolog/sbprolog/0.html. [Accessed 11 March, 2022]. |
| [85] | Codognet, P. and Diaz, D.1995. wamcc: Compiling Prolog to C. In Proceedings ICLP, L. Sterling, Ed. Press, Mit, 317-331. |
| [86] | Codognet, P. and Diaz, D.1996. Compiling constraints in clp(FD). Journal of Logic Programming 27, 3, 185-226. · Zbl 0874.68054 |
| [87] | Cohen, J.1979. Non-deterministic algorithms. Computing Surveys 11, 2, 79-94. · Zbl 0414.68011 |
| [88] | Cohen, J.1988. A view of the origins and development of Prolog. Communications of the ACM 31, 1, 26-36. |
| [89] | Colmerauer, A.1970a. Les systèmes Q ou un formalisme pour analyser et synthétiser des phrases sur ordinateur. Tech. Rep. Internal publication 43, Département d’Informatique, Université de Montréal. |
| [90] | Colmerauer, A.1970b. Total precedence relations. Journal of the ACM 17, 1, 14-30. · Zbl 0302.68020 |
| [91] | Colmerauer, A.1975. Les grammaires de métamorphose GIA. Internal publication, Groupe Intelligence artificielle, Faculté des Sciences de Luminy, Université Aix-Marseille II, France, Nov 1975. English version, Metamorphosis grammars. In Natural Language Communication with Computers, L. Bolc, Ed. Lecture Notes in Computer Science, vol. 63. Springer, 1978, 133-189. |
| [92] | Colmerauer, A.1979. Un sous-ensemble intéressant du français. RAIRO. Informatique théorique et Applications 13, 4, 309-336. · Zbl 0423.68044 |
| [93] | Colmerauer, A.1982a. Prolog and infinite trees. In Proceedings Workshop on Logic Programming 1980, K. L. Clark and S. Åke Tärnlund, Eds. Academic Press, 231-251. |
| [94] | Colmerauer, A.1982b. Prolog-II: Manuel de référence et modèle théorique. G.I.A. Université Aix-Marseille. |
| [95] | Colmerauer, A.1984. Equations and inequations on finite and infinite trees. In Proceedings FGCS. North-Holland, 85-99. |
| [96] | Colmerauer, A.1990. An introduction to Prolog III. In Proceedings Computational Logic, J. W. Lloyd, Ed. Springer, 37-79. |
| [97] | Colmerauer, A.1996. Les bases de Prolog IV. Tech. rep., Laboratoire d’Informatique de Marseille. |
| [98] | Colmerauer, A., Kanoui, H., Pasero, R. and Roussel, P.1973. Un système de communication homme-machine en français. Rapport préliminaire de fin de contrat IRIA. Tech. rep., Faculté des Sciences de Luminy, Université Aix-Marseille II. |
| [99] | Colmerauer, A. and Roussel, P.1996. The birth of Prolog. In Proceedings HOPL, T. J. Bergin and R. G. Gibson, Eds. ACM, 331-367. |
| [100] | Costa, V. S.1999. Optimising bytecode emulation for Prolog. In Proceedings PPDP, G. Nadathur, Ed. Lecture Notes in Computer Science, vol. 1702. Springer, 261-277. |
| [101] | Costa, V. S.2007. Prolog performance on larger datasets. In Proceedings PADL, M. Hanus, Ed. Lecture Notes in Computer Science, vol. 4354. Springer, 185-199. |
| [102] | Costa, V. S., Rocha, R. and Damas, L.2012. The YAP Prolog system. Theory and Practice of Logic Programming 12, 1-2, 5-34. · Zbl 1244.68017 |
| [103] | Costa, V. S., Sagonas, K. and Lopes, R.2007. Demand-driven indexing of Prolog clauses. In International Conference on Logic Programming, V. Dahl and I. Niemelä, Eds. Notes, Lecture in Computer Science, vol. 4670. Springer, 395-409. |
| [104] | Costa, V. S. and Vaz, D.2013. BigYAP: Exo-compilation meets UDI. Theory and Practice of Logic Programming 13, 4-5, 799-813. |
| [105] | Costa, V. S., Warren, D. H. and Yang, R.1991. Andorra I: A parallel Prolog system that transparently exploits both and-and or-parallelism. In Proceedings PPOPP, R. L. Wexelblat, Ed. ACM, 83-93. |
| [106] | Cousot, P. and Cousot, R.1977. Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In Proceedings POPL. ACM, 238-252. |
| [107] | Covington, M. A., Bagnara, R., O’Keefe, R. A., Wielemaker, J. and Price, S.2012. Coding guidelines for Prolog. Theory and Practice of Logic Programming 12, 6, 889-927. · Zbl 1255.68049 |
| [108] | Cropper, A., Dumančić, S. and Muggleton, S. H.2020. Turning 30: New ideas in inductive logic programming. In Proceedings IJCAI, C. Bessiere, Ed. International Joint Conferences on Artificial Intelligence Organization, 4833-4839. |
| [109] | Cyras, K., Rago, A., Albini, E., Baroni, P. and Toni, F.2021. Argumentative XAI: A survey. In Proceedings IJCAI, Z.-H. Zhou, Ed. International Joint Conferences on Artificial Intelligence Organization, 4392-4399. |
| [110] | Dahl, V.1977. Un système déductif d’interrogation de banques de données en espagnol. Ph.D. thesis, Université d’Aix-Marseille II. |
| [111] | Dahl, V.1979. Quantification in a three-valued logic for natural language question-answering systems. In Proceedings IJCAI. William Kaufmann, 182-187. |
| [112] | Dahl, V.1982. On database systems development through logic. Transactions on Database Systems 7, 1, 102-123. |
| [113] | Dahl, V.1986. Gramaticas discontinuas: una herramienta computacional con aplicaciones en la teoria de Reccion y Ligamiento. Revista Argentina de Lingüística 2, 2, 375-392. |
| [114] | Dahl, V.1990. Describing linguistic knowledge about constraints in user-friendly ways. International Journal of Expert Systems: Research and Applications 3, 2, 131-146. |
| [115] | Dahl, V.1992. Comment on implementing government-binding theories. In Formal Linguistics: Theory and Practice, R. Levine, Ed. Oxford University Press, 276-289. |
| [116] | Dahl, V., Bel-Enguix, G., Miralles, E. and Tirado, V. to appear. Grammar induction for under-resourced languages: The case of Ch’ol. In Proceedings AVERTIS 2019. Essays Dedicated to Manuel Hermenegildo on the Occasion of His 60th Birthday, J. Gallagher, R. Giacobazzi and P. Lopez-Garcia, Eds. Lecture Notes in Computer Science. Springer. |
| [117] | Dahl, V. and Mccord, M.1983. Treating coordination in logic grammars. Computational Linguistics 9, 69-91. |
| [118] | Dahl, V. and Miralles, J. E.2012. Womb grammars: Constraint solving for grammar induction. In Proceedings CHR, J. Sneyers and T. Frühwirth, Eds. Report CW, vol. 624. KU Leuven, 32-40. |
| [119] | Dahl, V., Popowich, F. and Rochemont, M.1993. A principled characterization of dislocated phrases: Capturing barriers with static discontinuity grammars. Linguistics and Philosophy 16, 331-352. |
| [120] | Dahl, V. and Sambuc, R.1976. Un système de banque de données en logique du premier ordre, en vue de sa consultation en langue naturelle. Tech. rep., D.E.A. Report, Université d’Aix-Marseille II. |
| [121] | Dahl, V. and Tarau, P.1998. From assumptions to meaning. Canadian Artificial Intelligence 42, 26-29. |
| [122] | Dahl, V. and Tarau, P.2004. Assumptive logic programming. In Proceedings ASAI. |
| [123] | Dahl, V., Tarau, P. and Li, R.1997. Assumption grammars for processing natural language. In Proceedings ICLP, L. Naish, Ed. MIT Press, 256-270. |
| [124] | Dahl, V., Tarau, P., Moreno, L. and Palomar, M.1995. Treating Coordination with Datalog Grammars. CoRR cmp-lg/9505006, 1-17. |
| [125] | Da Silva, A. F. and Santos Costa, V.2007. Design, implementation, and evaluation of a dynamic compilation framework for the YAP system. In Proceedings ICLP, V. Dahl and I. Niemelä, Eds. LNCS, vol. 4670. Springer, 410-424. |
| [126] | D’Avila Garcez, A. S. and Zaverucha, G.1999. The connectionist inductive learning and logic programming system. Applied Intelligence 11, 1, 59-77. |
| [127] | De Angelis, E., Fioravanti, F., Gallagher, J. P., Hermenegildo, M. V., Pettorossi, A. and Proietti, M.2021. Analysis and transformation of constrained horn clauses for program verification. Theory and Practice of Logic Programming, 20th Anniversary Special Issue. |
| [128] | De Kergommeaux, J. C. and Codognet, P.1994. Parallel logic programming systems. Computing Surveys 26, 3, 295-336. |
| [129] | De Raedt, L., Dumancic, S., Manhaeve, R. and Marra, G.2020. From statistical relational to neuro-symbolic artificial intelligence. In Proceedings IJCAI, C. Bessiere, Ed. International Joint Conferences on Artificial Intelligence Organization, 4943-4950. |
| [130] | De Raedt, L., Kersting, K., Natarajan, S. and Poole, D.2016. Statistical Relational Artificial Intelligence: Logic, Probability, and Computation. Synthesis Lectures on Artificial Intelligence and Machine Learning. Morgan & Claypool Publishers. · Zbl 1352.68005 |
| [131] | De Raedt, L., Kimmig, A. and Toivonen, H.2007. ProbLog: A probabilistic Prolog and its application in link discovery. In Proceedings IJCAI, M. M. Veloso, Ed. International Joint Conferences on Artificial Intelligence Organization, 2462-2467. |
| [132] | Denti, E., Omicini, A. and Calegari, R.2013. tuProlog: Making Prolog ubiquitous. Association for Logic Programming Newsletter. |
| [133] | Denti, E., Omicini, A. and Ricci, A.2001. tuProlog: A light-weight Prolog for Internet applications and infrastructures. In Proceedings PADL, I. Ramakrishnan, Ed. Lecture Notes in Computer Science, vol. 1990. Springer, 184-198. |
| [134] | Deransart, P., Ed-Dbali, A. and Cervoni, L.1996. Prolog: The Standard. Springer. · Zbl 0844.68017 |
| [135] | Devlin, J., Chang, M.-W., Lee, K. and Toutanova, K.2019. BERT: Pre-training of deep bidirectional transformers for language understanding. In Proceedings NAACL. Association for Computational Linguistics, 4171-4186. |
| [136] | Diaz, D., Abreu, S. and Codognet, P.2012. On the implementation of GNU Prolog. Theory and Practice of Logic Programming 12, 1-2, 253-282. · Zbl 1244.68018 |
| [137] | Diaz, D. and Codognet, P.1993. A minimal extension of the WAM for clp(FD). In Proceedings ICLP, D. S. Warren, Ed. MIT Press, 774-790. |
| [138] | Diaz, D. and Codognet, P.2000. GNU Prolog: Beyond compiling Prolog to C. In Proceedings PADL, E. Pontelli and V. S. Costa, Eds. Lecture Notes in Computer Science, vol. 1753. Springer, 81-92. |
| [139] | Dietrich, R. and Hagl, F.1988. A polymorphic type system with subtypes for Prolog. In Proceedings ESOP, H. Ganzinger, Ed. Lecture Notes in Computer Science, vol. 300. Springer, 79-93. |
| [140] | Dincbas, M., Hentenryck, P. V., Simonis, H. and Aggoun, A.1988. The constraint logic programming language CHIP. In Proceedings FGCS. IOS Press, 249-264. |
| [141] | Dovier, A., Formisano, A., Gupta, G., Hermenegildo, M. V., Pontelli, E. and Rocha, R.2022. Parallel logic programming: A sequel. Theory and Practice of Logic Programming, 20th Anniversary Special Issue. |
| [142] | Earley, J.1970. An efficient context-free parsing algorithm. Communications of the ACM 13, 2, 94-102. · Zbl 0185.43401 |
| [143] | ECLiPSe Prolog Homepage2021. The ECLiPSe Constraint Programming System. URL: https://eclipseclp.org. [Accessed 11 March, 2022]. |
| [144] | Elcock, E.1990. Absys: The first logic programming language. Journal of Logic Programming 9, 1, 1-17. · Zbl 0711.68025 |
| [145] | Ethnologue2021. Ethnologue: Languages of the World. URL: https://www.ethnologue.com/. [Accessed 11 March, 2022]. |
| [146] | Felleisen, M.1985. Transliterating Prolog into Scheme. Tech. Rep. 182, Indiana University. Department of Computer Science. |
| [147] | Flanagan, C.2006. Hybrid type checking. In Proceedings POPL. ACM, 245-256. · Zbl 1370.68202 |
| [148] | Floridi, L. and Chiriatti, M.2020. GPT-3: Its nature, scope, limits, and consequences. Minds and Machines 30, 4, 681-694. |
| [149] | Floyd, R. W.1967. Nondeterministic algorithms. Journal of the ACM 14, 4, 636-644. · Zbl 0153.47006 |
| [150] | Forgy, C. L.1989. Rete: A fast algorithm for the many pattern/many object pattern match problem. In Readings in Artificial Intelligence and Databases. Elsevier, 547-559. |
| [151] | França, M. V. M., Zaverucha, G. and D’Avila Garcez, A. S.2014. Fast relational learning using bottom clause propositionalization with artificial neural networks. Machine Learning 94, 1, 81-104. |
| [152] | Frühwirth, T.1992. Constraint simplification rules. In Proceedings JICSLP Workshop on Constraint Logic Programming. (Also available as Technical Report ECRC-92-18, ECRC Munich, Germany, July 1992). |
| [153] | Frühwirth, T.2009. Constraint Handling Rules. Cambridge University Press. · Zbl 1182.68039 |
| [154] | Gackenheimer, C. and Paul, A.2015. Introduction to React, vol. 52. Springer. |
| [155] | Gallagher, J. P. and Henriksen, K. S.2004. Abstract domains based on regular types. In International Conference on Logic Programming. Springer, 27-42. · Zbl 1104.68377 |
| [156] | Gallaire, H., Minker, J. and Nicolas, J.1984. Logic and databases: A deductive approach. ACM Computing Surveys 16, 153-185. · Zbl 0548.68098 |
| [157] | Garcia-Contreras, I., Morales, J. F. and Hermenegildo, M. V.2016. Semantic code browsing. Theory and Practice of Logic Programming, ICLP 2016 Special Issue 16, 5-6, 721-737. · Zbl 1379.68030 |
| [158] | García De La Banda, M., Bueno, F. and Hermenegildo, M.1996. Towards independent and-parallelism in CLP. In Proceedings PLILP, H. Kuchen and S. D. Swierstra, Eds. Lecture Notes in Computer Science, vol. 1140. Springer, 77-91. |
| [159] | García De La Banda, M., Hermenegildo, M. V. and Marriott, K.2000. Independence in CLP languages. ACM Transactions on Programming Languages and Systems 22, 2, 269-339. |
| [160] | Gebser, M., Kaminski, R., Kaufmann, B., Ostrowski, M., Schaub, T. and Thiele, S.2008. A User’s Guide to gringo, clasp, clingo, and iclingo. URL: https://potassco.org/. [Accessed on 11 March, 2022]. |
| [161] | Gebser, M., Kaminski, R., Kaufmann, B. and Schaub, T.2014. Clingo = ASP + Control: Preliminary Report. arXiv 1405.3694. |
| [162] | Prolog, Gnu2021. The GNU Prolog web site. URL: http://gprolog.org. [Accessed 11 March, 2022]. |
| [163] | Green, C. C.1969a. Application of theorem proving to problem solving. In Proceedings IJCAI, D. E. Walker and L. M. Norton, Eds. William Kaufmann, 219-240. |
| [164] | Green, C. C.1969b. The Application of Theorem Proving to Question-Answering Systems. Outstanding Dissertations in the Computer Sciences. Garland Publishing, New York. |
| [165] | Guidotti, R., Monreale, A., Turini, F., Pedreschi, D. and Giannotti, F.2019. A survey of methods for explaining Black Box models. Computing Surveys 51, 5, 1-42. |
| [166] | Gunning, D.2016. Explainable Artificial Intelligence (XAI). Funding Program DARPA-BAA-16-53, Defense Advanced Research Projects Agency (DARPA). |
| [167] | Gupta, G., Bansal, A., Min, R., Simon, L. and Mallya, A.2007. Coinductive logic programming and its applications. In Proceedings ICLP, V. Dahl and I. Niemelä, Eds. Lecture Notes in Computer Science, vol. 4670. Springer, 27-44. · Zbl 1213.68177 |
| [168] | Gupta, G. and Pontelli, E.1999. Extended dynamic dependent and-parallelism in ACE. Journal of Functional and Logic Programming 99, Special Issue 1. · Zbl 0923.68055 |
| [169] | Gupta, G., Pontelli, E., Ali, K., Carlsson, M. and Hermenegildo, M. V.2001. Parallel execution of Prolog programs: A survey. Transactions on Programming Languages and Systems 23, 4, 472-602. |
| [170] | Gupta, G., Saeedloei, N., Devries, B. W., Min, R., Marple, K. and Kluzniak, F.2011. Infinite computation, co-induction and computational logic. In Proceedings CALCO, A. Corradini, B. Klin, and C. Cîrstea, Eds. Notes, Lecture in Computer Science, vol. 6859. Springer, 40-54. · Zbl 1344.68053 |
| [171] | Gurr, C. A.1994. Specialising the ground representation in the logic programming language Gödel. In Proceedings LOPSTR 1993, Y. Deville, Ed. Workshops in Computing. Springer, 124-140. |
| [172] | Haemmerlé, R. and Fages, F.2006. Modules for Prolog revisited. In Proceedings ICLP, S. Etalle and M. Truszczyński, Eds. Notes, Lecture in Computer Science, vol. 4079. Springer, 41-55. · Zbl 1131.68378 |
| [173] | Hankley, W.1987. Feature analysis of Turbo Prolog. ACM SIGPLAN Notices 22, 3, 111-118. |
| [174] | Hanus, M.1997. Teaching functional and logic programming with a single computation model. In Proceedings PLILP, H. Glaser, P. Hartel and H. Kuchen, Eds. Notes, Lecture in Computer Science, vol. 1292. Springer, 335-350. |
| [175] | Hanus, M. and Krone, J.2017. A typeful integration of SQL into curry. In Proceedings WLP 2015/2016 and WFLP 2016, Schwarz, S. and Voigtländer, J., Eds. EPTCS, vol. 234. CoRR, 104-119. |
| [176] | Hanus, M., Kuchen, H. and Moreno-Navarro, J.1995. Curry: A truly functional logic language. In Proceedings Workshop on Visions for the Future of Logic Programming, 95-107. |
| [177] | Haynes, C. T.1986. Logic continuations. In Proceedings ICLP, E. Shapiro, Ed. Notes, Lecture in Computer Science, vol. 225. Springer, 671-685. · Zbl 0602.68011 |
| [178] | Hentenryck, P. V., Saraswat, V. A. and Deville, Y.1994. Design, implementation, and evaluation of the constraint language cc(FD). In Proceedings TCS School, A. Podelski, Ed. Notes, Lecture in Computer Science, vol. 910. Springer, 293-316. · Zbl 0920.68026 |
| [179] | Henz, M., Smolka, G. and Würtz, J.1993. Oz - A programming language for multi-agent systems. In Proceedings IJCAI, R. Bajcsy, Ed. Kaufmann, Morgan, 404-409. |
| [180] | Hermenegildo, M.1986. An abstract machine for restricted AND-parallel execution of logic programs. In Proceedings ICLP. Lecture Notes in Computer Science, vol. 225. Springer, 25-40. · Zbl 0598.68021 |
| [181] | Hermenegildo, M.2000. Parallelizing irregular and pointer-based computations automatically: Perspectives from logic and constraint programming. Parallel Computing 26, 13-14, 1685-1708. · Zbl 0948.68024 |
| [182] | Hermenegildo, M. and Group, Clip, T. 1993. Towards CIAO-Prolog - A parallel concurrent constraint system. In Proceedings of the Compulog Net Area Workshop on Parallelism and Implementation Technologies. FIM/UPM. |
| [183] | Hermenegildo, M., Puebla, G., Bueno, F. and Garcia, P. L.2005. Integrated program debugging, verification, and optimization using abstract interpretation (and The Ciao System Preprocessor). Science of Computer Programming 58, 1-2, 115-140. · Zbl 1076.68540 |
| [184] | Hermenegildo, M. V.1989. High-performance Prolog Implementation: The WAM and Beyond (tutorial). Tech. rep., ICLP. |
| [185] | Hermenegildo, M. V.2012. Conferences vs. Journals in CS, what to do? Evolutionary ways forward and the ICLP/TPLP model. In Publication Culture in Computing Research — Position Papers, K. Mehlhorn, M. Y. Vardi and M. Herbstritt, Eds. Dagstuhl Reports, vol. 12452. Dagstuhl Publishing, 29-30. URL: http://cliplab.org/papers/dagstuhl-tplpmove.pdf. |
| [186] | Hermenegildo, M. V., Bueno, F., Cabeza, D., Carro, M., Garcia De La Banda, M., Lãpez-García, P. and Puebla, G.1996. The CIAO multi-dialect compiler and system: An experimentation workbench for future (C)LP systems (extended abstract). In Proceedings AGP, P. Lucio, M. Martelli and M. Navarro, Eds., 105-110. |
| [187] | Hermenegildo, M. V., Bueno, F., Carro, M., López-Garca, P., Mera, E., Morales, J. F. and Puebla, G.2012. An overview of Ciao and its design philosophy. Theory and Practice of Logic Programming 12, 1-2, 219-252. · Zbl 1244.68019 |
| [188] | Hermenegildo, M. V., Puebla, G. and Bueno, F.1999. Using global analysis, partial specifications, and an extensible assertion language for program validation and debugging. In The Logic Programming Paradigm: a 25-Year Perspective, K. R. Apt, V. W. Marek, M. Truszczynski and D. S. Warren, Eds. Springer, 161-192. · Zbl 0979.68554 |
| [189] | Hermenegildo, M.1994. Some methodological issues in the design of CIAO - A generic, parallel, concurrent constraint system. In Proceedings PPCP, A. Borning, Ed. Lecture Notes in Computer Science, vol. 874. Springer, 123-133. |
| [190] | Hewitt, C.1969. PLANNER: A language for proving theorems in robots. In Proceedings IJCAI, D. E. Walker and L. M. Norton, Eds. William Kaufmann, 295-302. |
| [191] | Hill, P. and Lloyd, J. W.1994. The Gödel Programming Language. MIT press. · Zbl 0850.68138 |
| [192] | Hoarau, S. and Mesnard, F.1998. Inferring and compiling termination for constraint logic programs. In Proceedings LOPSTR, P. Flener, Ed. Lecture Notes in Computer Science, vol. 1559. Springer, 240-254. · Zbl 0908.68026 |
| [193] | Holzbaur, C.1992. Metastructures vs. attributed variables in the context of extensible unification. In Proceedings PLILP, M. Bruynooghe and M. Wirsing, Eds. Lecture Notes in Computer Science, vol. 631. Springer, 260-268. |
| [194] | Holzbaur, C.1995. OFAI CLP(Q,R) Manual, Edition 1.3.3. Tech. Rep. TR-95-09, Austrian Research Institute for Artificial Intelligence, Vienna. |
| [195] | Huang, S. S., Green, T. J. and Loo, B. T.2011. Datalog and emerging applications: An interactive tutorial. In Proceedings MOD. ACM, 1213-1216. |
| [196] | Ireson-Paine, J.2010. The public-domain Prolog library. URL: http://www.j-paine.org/prolog/library.html. [Accessed 11 March, 2022]. |
| [197] | ISO/IEC 13211-1. 1995. Information technology - Programming languages - Prolog - Part 1: General core. ISO Standard, International Organization for Standardization. |
| [198] | ISO/IEC 13211-2. 2000. Information technology - Programming languages - Prolog - Part 2: Modules. ISO Standard, International Organization for Standardization. |
| [199] | ISO/IEC 14882. 2020. Programming languages — C++. ISO Standard, International Organization for Standardization. |
| [200] | Jaffar, J. and Lassez, J.1987. Constraint logic programming. In Proceedings POPL. ACM, 111-119. |
| [201] | Jaffar, J. and Maher, M.1994. Constraint logic programming: A survey. Journal of Logic Programming 19/20, 503-581. |
| [202] | Jaffar, J., Michaylov, S., Stuckey, P. J. and Yap, R. H. C.1992. The CLP \(( \cal R\) ) language and system. Transactions on Programming Languages and Systems 14, 3, 339-395. |
| [203] | Janson, S. and Haridi, S.1991. Programming Paradigms of the Andorra Kernel Language. Tech. Rep. R-91/8-SE, SICS. |
| [204] | Janssens, G.1984. WIC — Warren Improved Code. Tech. rep., BIM. Internal Report IR1, URL: https://people.cs.kuleuven.be/ Maurice.Bruynooghe/Prolog/IR01.pdf. |
| [205] | Johnson, K., Pasquale, F. and Chapman, J.2019. Artificial intelligence, machine learning, and bias in finance: Toward responsible innovation. Fordham Law Review 88, 2, 499-529. |
| [206] | Johnson, K. and Rae, R.1983. Edinburgh Prolog Tools. Tech. Rep. Note No. 103, Programming Systems Group, AI Applications Institute, Edinburgh University. |
| [207] | Jordan, H., Scholz, B. and Subotic, P.2016. Soufflé: On synthesis of program analyzers. In Proceedings CAV, Part II, S. Chaudhuri and A. Farzan, Eds. Lecture Notes in Computer Science, vol. 9780. Springer, 422-430. |
| [208] | Homepage, Julia2021. Julia. URL: https://julialang.org/. [Accessed 11 March, 2022]. |
| [209] | Kacsuk, P. and Wise, M.1992. Implementations of Distributed Prolog. John Wiley & Sons, Inc. |
| [210] | Kaufmann, M. and Boyer, R. S.1995. The Boyer-Moore theorem prover and its interactive enhancement. Computers and Mathematics with Applications 29, 2, 27-62. |
| [211] | Kay, M.1967. Experiments with a powerful parser. In Proceedings COLING, vol. 1, 1-20. |
| [212] | Kowalski, R.1979. Algorithm = Logic + Control. Communications of the ACM 22, 7, 424-436. · Zbl 0404.68010 |
| [213] | Kowalski, R.2013. Logic programming in the 1970s. In Proceedings LPNMR, P. Cabalar and T. C. Son, Eds. Lecture Notes in Computer Science, vol. 8148. Springer, 11-22. · Zbl 1405.68049 |
| [214] | Kowalski, R.2020. Logical English. In Proceedings LPOP, D. Warren, P. V. Roy and Y. A. Liu, Eds. 33-37. |
| [215] | Kowalski, R. and Kuehner, D.1971. Linear resolution with selection function. Artificial Intelligence 2, 3, 227-260. · Zbl 0234.68037 |
| [216] | Kowalski, R. and Sadri, F.2015. Reactive computing as model generation. New Generation Computing 33, 1, 33-67. · Zbl 1333.68108 |
| [217] | Kowalski, R. A.1974. Predicate logic as programming language. In Proceedings IFIP, J. L. Rosenfeld, Ed. North-Holland, 569-574. · Zbl 0297.68006 |
| [218] | Kowalski, R. A.1988. The early years of logic programming. Communications of the ACM 31, 1, 38-43. |
| [219] | Lally, A., Prager, J. M., Mccord, M. C., Boguraev, B., Patwardhan, S., Fan, J., Fodor, P. and Chu-Carroll, J.2012. Question analysis: How Watson reads a clue. Journal of Research and Development 56, 3.4, 2:1-2:14. |
| [220] | Lamb, L. C., D’Avila Garcez, A. S., Gori, M., Prates, M. O. R., Avelar, P. H. C. and Vardi, M. Y.2020. Graph neural networks meet neural-symbolic computing: A survey and perspective. In Proceedings IJCAI, C. Bessiere, Ed. International Joint Conferences on Artificial Intelligence Organization, 4877-4884. |
| [221] | \( \lambda\) Prolog Home Page 2021. URL: http://www.lix.polytechnique.fr/Labo/Dale.Miller/lProlog/. [Accessed 11 March, 2022]. |
| [222] | Leone, N., Pfeifer, G., Faber, W., Eiter, T., Gottlob, G., Perri, S. and Scarcello, F.2006. The DLV system for knowledge representation and reasoning. ACM Transactions on Computational Logic 7, 3, 499-562. · Zbl 1367.68308 |
| [223] | Leuschel, M.2008. Declarative programming for verification: Lessons and outlook. In Proceedings PPDP. ACM Press, 1-7. |
| [224] | Leuschel, M.2020. Fast and effective well-definedness checking. In Proceedings IFM, B. Dongol and E. Troubitsyna, Eds. Lecture Notes in Computer Science, vol. 12546. Springer, 63-81. |
| [225] | Leuschel, M. and Bruynooghe, M.2002. Logic program specialisation through partial deduction: Control issues. Theory and Practice of Logic Programming 2, 4 & 5, 461-515. · Zbl 1105.68331 |
| [226] | Leuschel, M. and Butler, M. J.2008. ProB: An automated analysis toolset for the B method. International Journal on Software Tools for Technology Transfer 10, 2, 185-203. |
| [227] | Lifschitz, V.1999. Action languages, answer sets, and planning. In The Logic Programming Paradigm, K. R. Apt, V. W. Marek, M. Truszczynski and D. S. Warren, Eds. Springer, 357-373. · Zbl 0979.68517 |
| [228] | Lindholm, T., Yellin, F., Bracha, G., Buckley, A. and Smith, D.2021. The Java Virtual Machine Specification (Java SE 17 Edition). Oracle. |
| [229] | Lipton, Z. C.2018. The Mythos of model interpretability. Queue 16, 3. |
| [230] | Lopes, R., Costa, V. S. and Silva, F. M. A.2012. A design and implementation of the extended Andorra model. Theory and Practice of Logic Programming 12, 3, 319-360. · Zbl 1247.68045 |
| [231] | Lopez-Garcia, P., Darmawan, L., Klemen, M., Liqat, U., Bueno, F. and Hermenegildo, M. V.2018. Interval-based resource usage verification by translation into Horn clauses and an application to energy consumption. Theory and Practice of Logic Programming, Special Issue on Computational Logic for Verification 18, 2, 167-223. · Zbl 1478.68170 |
| [232] | LPA Ltd. 2021. About LPA. URL: https://www.lpa.co.uk/hom_lpa.htm. [Accessed 11 March, 2022]. |
| [233] | Lusk, E., Butler, R., Disz, T., Olson, R., Overbeek, R., Stevens, R., Warren, D. H. D., Calderwood, A., Szeredi, P., Haridi, S., Brand, P., Carlsson, M., Ciepielewski, A. and Hausman, B.1990. The Aurora or-parallel Prolog system. New Generation Computing 7, 2-3, 243-271. |
| [234] | Madsen, M. and Lhoták, O.2020. Fixpoints for the masses: Programming with first-class datalog constraints. Proceedings of the ACM on Programming Languages 4, OOPSLA, 125:1-125:28. |
| [235] | Maher, M. J.1987. Logic semantics for a class of committed-choice programs. In Proceedings ICLP, J.-L. Lassez, Ed. MIT Press, 858-876. |
| [236] | Maier, D., Tekle, K. T., Kifer, M. and Warren, D. S.2018. Datalog: Concepts, history, and outlook. In Declarative Logic Programming: Theory, Systems, and Applications, M. Kifer and Y. A. Liu, Eds. ACM, 3-100. |
| [237] | Manthey, R. and Bry, F.1988. SATCHMO: A theorem prover implemented in Prolog. In Proceedings CADE, R. O. Ewing Lusk, Ed. Lecture Notes in Computer Science, vol. 310. Springer, 415-434. · Zbl 0668.68104 |
| [238] | Marcus, G. and Davis, E.2020. GPT-3, Bloviator: OpenAI’s language generator has no idea what it’s talking about. Technology Review. |
| [239] | Marek, V. W. and Truszczynski, M.1999. Stable models and an alternative logic programming paradigm. In The Logic Programming Paradigm - A 25-Year Perspective, K. R. Apt, V. W. Marek, M. Truszczynski and D. S. Warren, Eds. Springer, 375-398. · Zbl 0979.68524 |
| [240] | Marple, K., Salazar, E. and Gupta, G.2017. Computing Stable Models of Normal Logic Programs Without Grounding. arXiv 1709.00501. |
| [241] | Marriott, K. and Stuckey, P.1998. Programming with Constraints: An Introduction. MIT Press. · Zbl 0935.68098 |
| [242] | Mccarthy, J.1962. LISP 1.5 Programmer’s Manual. MIT Press. |
| [243] | Mccord, M.2006. The Slot Grammar Lexical Formalism. Tech. rep., IBM Research Division, Thomas J. Watson Research Center. |
| [244] | Mcjones, P.2021. Prolog and Logic Programming Historical Sources Archive. URL: http://www.softwarepreservation.org/projects/prolog/index.html. [Accessed 11 March, 2022]. |
| [245] | Mellish, C. S.1979. Short Guide to UNIX PROLOG Implementation. Tech. rep., Department of Artificial Intelligence, University of Edinburgh. |
| [246] | Méndez-Lojo, M., Navas, J. and Hermenegildo, M.2007. A flexible (C)LP-based approach to the analysis of object-oriented programs. In Proceedings LOPSTR, A. King, Ed. LNCS, vol. 4915. Springer, 154-168. · Zbl 1179.68030 |
| [247] | Mera, E., Lopez-Garcia, P. and Hermenegildo, M. V.2009. Integrating software testing and run-time checking in an assertion verification framework. In Proceedings ICLP, P. M. Hill and D. S. Warren, Eds. Notes, Lecture in Computer Science, vol. 5649. Springer, 281-295. |
| [248] | Mesnard, F., Payet, É. and Neumerkel, U.2002. Detecting optimal termination conditions of logic programs. In Proceedings SAS, M. V. Hermenegildo and G. Puebla, Eds. Lecture Notes in Computer Science, vol. 2477. Springer, 509-526. · Zbl 1015.68032 |
| [249] | Miller, D.2021. Reciprocal influences between proof theory and logic programming. Philosophy & Technology 34. |
| [250] | Miller, D. and Nadathur, G.2012. Programming with Higher-Order Logic. Cambridge University Press. · Zbl 1267.68014 |
| [251] | Monteiro, L. and Porto, A.1989. Contextual logic programming. In Proceedings ICLP, G. Levi and M. Martelli, Eds. MIT Press, 284-299. |
| [252] | Morales, J., Carro, M. and Hermenegildo, M. V.2004. Improving the compilation of Prolog to C using moded types and determinism information. In Proceedings PADL, B. Jayaraman, Ed. Notes, Lecture in Computer Science, vol. 3057. Springer, 86-103. |
| [253] | Morales, J., Carro, M. and Hermenegildo, M. V.2008. Comparing tag scheme variations using an abstract machine generator. In Proceedings PPDP. ACM Press, 32-43. |
| [254] | Morales, J., Carro, M. and Hermenegildo, M. V.2016. Description and optimization of abstract machines in a dialect of Prolog. Theory and Practice of Logic Programming 16, 1, 1-58. · Zbl 1379.68079 |
| [255] | Morales, J., Carro, M., Puebla, G. and Hermenegildo, M.2005. A generator of efficient abstract machine implementations and its application to emulator minimization. In Proceedings ICLP, M. Gabbrielli and G. Gupta, Eds. LNCS, vol. 3668. Springer, 21-36. · Zbl 1165.68336 |
| [256] | Moura, P.2003. Design of an Object-Oriented Logic Programming Language. Ph.D. thesis, Universidade da Beira Interior. |
| [257] | Moura, P.2005. Prolog portability and standardization. Association for Logic Programming Newsletter 18, 3. |
| [258] | Moura, P.2007. Prolog multi-threading support. URL: https://logtalk.org/plstd/threads.pdf. |
| [259] | Moura, P.2009a. From plain Prolog to Logtalk objects: Effective code encapsulation and reuse. In Proceedings ICLP, P. M. Hill and D. S. Warren, Eds. Lecture Notes in Computer Science, vol. 5649. Springer, 23-23. |
| [260] | Moura, P.2009b. Uniting the Prolog community: Personal notes. Association for Logic Programming Newsletter 22, 1. |
| [261] | Moura, P.2011. Programming patterns for Logtalk parametric objects. In Proceedings INAP/WLP, S. Abreu and D. Seipel, Eds. Lecture Notes in Computer Science, vol. 3392. Springer, 52-69. |
| [262] | Muggleton, S. and De Raedt, L.1994. Inductive logic programming: Theory and methods. Journal of Logic Programming 19/20, 629-679. · Zbl 0816.68043 |
| [263] | Muthukumar, K., Bueno, F., De La Banda, M. G. and Hermenegildo, M.1999. Automatic compile-time parallelization of logic programs for restricted, goal-level, independent and-parallelism. Journal of Logic Programming 38, 2, 165-218. · Zbl 0927.68018 |
| [264] | Muthukumar, K. and Hermenegildo, M.1989. Determination of variable dependence information at compile-time through abstract interpretation. In Proceedings North American Conference on Logic Programming, E. L. Lusk and R. A. Overbeek, Eds. MIT Press, 166-189. |
| [265] | Muthukumar, K. and Hermenegildo, M.1990. The CDG, UDG, and MEL methods for automatic compile-time parallelization of logic programs for independent and-parallelism. In Proceedings ICLP. MIT Press, 221-237. |
| [266] | Mycroft, A. and O’Keefe, R. A.1984. A polymorphic type system for Prolog. Artificial intelligence 23, 3, 295-307. · Zbl 0543.68076 |
| [267] | Nadathur, G.2001. The metalanguage \(\lambda\) prolog and its implementation. In Proceedings FLOPS, H. Kuchen and K. Ueda, Eds. Lecture Notes in Computer Science, vol. 2024. Springer, 1-20. · Zbl 0977.68508 |
| [268] | Nadathur, G. and Miller, D.1988. An Overview of Lambda Prolog. Tech. Rep. 595, Department of Computer & Information Science, University of Pennsylvania. |
| [269] | Naish, L.1982. An Introduction to MU-Prolog. Tech. Rep. 82/2, University of Melbourne. |
| [270] | Naish, L.1985. Prolog control rules. In Proceedings IJCAI, A. K. Joshi, Ed. Morgan Kaufmann, 720-722. |
| [271] | Naish, L.1986. Negation and Control in Prolog. Lecture Notes in Computer Science, vol. 238. Springer. · Zbl 0602.68006 |
| [272] | Nässén, H., Carlsson, M. and Sagonas, K.2001. Instruction merging and specialization in the SICStus Prolog virtual machine. In Proceedings PPDP. ACM Press, 49-60. |
| [273] | Nethercote, N., Stuckey, P. J., Becket, R., Brand, S., Duck, G. J. and Tack, G.2007. MiniZinc: Towards a standard CP modelling language. In Proceedings CP, C. BessiÈre, Ed. Lecture Notes in Computer Science, vol. 4741. Springer, 529-543. |
| [274] | Neumerkel, U.1990. Extensible unification by metastructures. In Proceedings META. |
| [275] | Neumerkel, U.1994. A transformation based on the equality between terms. In Proceedings LOPSTR, Y. Deville, Ed. Workshop in Computing. Springer, 162-176. |
| [276] | Neumerkel, U.2013. SWI7 and ISO Prolog. URL: https://www.complang.tuwien.ac.at/ulrich/iso-prolog/SWI7_and_ISO. [Accessed 11 March, 2022]. |
| [277] | Neumerkel, U. and Kral, S.2002. Declarative program development in Prolog with GUPU. In Proceedings WLPE, A. Tessier, Ed. 77-86. |
| [278] | Neumerkel, U. W.1992. Specialization of Prolog Programs with Partially Static Goals and Binarization. Ph.D. thesis, TU Wien. |
| [279] | Niemelä, I.1999. Logic programs with stable model semantics as a constraint programming paradigm. Annals of Mathematics and Artificial Intelligence 25, 241-273. · Zbl 0940.68018 |
| [280] | Noble, S. U.2018. Algorithms of Oppression: How Search Engines Reinforce Racism. New York University Press. |
| [281] | Nogatz, F., Körner, P. and Krings, S.2019. Prolog coding guidelines: Status and tool support. In Proceedings ICLP (Technical Communications), B. Bogaerts, E. Erdem, P. Fodor, A. Formisano, G. Ianni, D. Inclezan, G. Vidal, A. Villanueva, M. D. Vos and F. Yang, Eds. EPTCS, vol. 306. CoRR, 8-21. · Zbl 1543.68078 |
| [282] | Nori, K. V., Ammann, U., Jensen, K. and Nägeli, H.1974. The PASCAL ‘P’ Compiler: Implementation Notes. Tech. rep., Berichte des Instituts für Informatik, ETH ZÜrich. |
| [283] | O’Keefe, R. A.1990. The Craft of Prolog. MIT Press. |
| [284] | Older, W. and Benhamou, F.1993. Programming in CLP(BNR). In Proceedings PPCP, P. Kanellakis, J.-L. Lassez, and V. Saraswat, Eds. 239-249. |
| [285] | Omicini, A. and Denti, E.2001. From tuple spaces to tuple centres. Science of Computer Programming 41, 3, 277-294. · Zbl 0989.68120 |
| [286] | Omicini, A. and Zambonelli, F.1998. Co-ordination of mobile information agents in TuCSoN. Internet Research 8, 5, 400-413. |
| [287] | Panch, T., Mattie, H. and Atun, R.2019. Artificial intelligence and algorithmic bias: implications for health systems. Journal of Global Health 9, 2. |
| [288] | Pasero, R.1973. ReprÉsentation du franÇais en logique du premier ordre en vue de dialoguer avec un ordinateur. Ph.D. thesis, FacultÉ des Sciences de Luminy, Université Aix-Marseille II. |
| [289] | Paxton, B.2021. Erlang Companies. URL: https://erlang-companies.org/. [Accessed 11 March, 2022]. |
| [290] | Pereira, F. C.1983. C-Prolog User’s Manual. EdCaad, University of Edinburgh. |
| [291] | Pereira, F. C. and Warren, D. H.1980. Definite clause grammars for language analysis — A survey of the formalism and a comparison with augmented transition networks. Artificial intelligence 13, 3, 231-278. · Zbl 0442.68088 |
| [292] | Pereira, F. C. N. and Shieber, S. M.1987. Prolog and Natural-Language Analysis. CSLI. CSLI Publications, 185-210. · Zbl 0684.68010 |
| [293] | Pereira, L. M., Pereira, F. C. and Warren, D. H.1978. User’s Guide to DECsystem-10 Prolog. Department of Artificial Intelligence, University of Edinburgh. |
| [294] | Pereira, L. M. and Porto, A.1979. Intelligent backtracking and sidetracking in Horn clause programs-the theory. Tech. Rep. CIUNL 2/79, Universidade Nova de Lisboa. Centro de Informatica. |
| [295] | Piancastelli, G., Benini, A., Omicini, A. and Ricci, A.2008. The Architecture and design of a malleable object-oriented Prolog engine. In Proceedings SAC, R. L. Wainwright, H. M. Haddad, R. Menezes and M. Viroli, Eds., vol. 1. ACM, 191-197. |
| [296] | Pineda, A. and Bueno, F.2002. The O’Ciao approach to object oriented logic programming. In Proceedings CICLOPS, B. Demoen, Ed. Report CW, vol. 344. KU Leuven, 37-48. |
| [297] | Pisano, G., Calegari, R., Omicini, A. and Sartor, G.2020. Arg- tuProlog: A tuProlog-based argumentation framework. In Proceedings CILC, F. Calimeri, S. Perri and E. Zumpano, Eds. CEUR Workshop Proceedings, vol. 2719. CEUR, 51-66. |
| [298] | Pisano, G., Ciatto, G., Calegari, R. and Omicini, A.2020. Neuro-symbolic computation for XAI: Towards a unified model. In Proceedings WOA, R. Calegari, G. Ciatto, E. Denti, A. Omicini and G. Sartor, Eds. CEUR Workshop Proceedings, vol. 2706. CEUR, 101-117. |
| [299] | Poole, D.1993. Probabilistic horn abduction and Bayesian networks. Artificial Intelligence 64, 1, 81-129. · Zbl 0792.68176 |
| [300] | Prolog Commons Working Group2021. URL: http://prolog-commons.org/. [Accessed 11 March, 2022]. |
| [301] | Puebla, G., Bueno, F. and Hermenegildo, M. V.2000a. A generic preprocessor for program validation and debugging. In Analysis and Visualization Tools for Constraint Programming, P. Deransart, M. V. Hermenegildo and J. MaŁuszynski, Eds. Lecture Notes in Computer Science, vol. 1870. Springer, 63-107. |
| [302] | Puebla, G., Bueno, F. and Hermenegildo, M. V.2000b. An assertion language for constraint logic programs. In Analysis and Visualization Tools for Constraint Programming, P. Deransart, M. V. Hermenegildo and J. Małuszynski, Eds. Lecture Notes in Computer Science, vol. 1870. Springer, 23-61. · Zbl 0964.68016 |
| [303] | Homepage, Python2021. Welcome to python.org. URL: https://www.python.org/. [Accessed 11 March, 2022]. |
| [304] | Homepage, R2021. R: The R Project for Statistical Computing. URL: https://www.r-project.org/. [Accessed 11 March, 2022]. |
| [305] | RackLog Homepage2021. The RackLog Language. URL: https://docs.racket-lang.org/racklog/index.html. [Accessed 11 March, 2022]. |
| [306] | Ramakrishnan, R., Srivastava, D., Sudarshan, S. and Seshadri, P.1994. The CORAL deductive system. The International Journal on Very Large Data Bases 3, 2, 161-210. |
| [307] | Ramakrishnan, R. and Ullman, J. D.1993. A survey of research on deductive database systems. Journal of Logic Programming 23, 2, 125-149. |
| [308] | Rao, P., Sagonas, K., Swift, T., Warren, D. S. and Freire, J.1997. XSB: A system for efficiently computing well founded semantics. In Proceedings LPNMR, J. Dix, U. Furbach and A. Nerode, Eds. Notes, Lecture in Computer Science, vol. 1265. Springer, 430-440. |
| [309] | Rastogi, A., Swamy, N., Fournet, C., Bierman, G. and Vekris, P.2015. Safe & efficient gradual typing for TypeScript. In Proceedings POPL. ACM, 167-180. · Zbl 1346.68049 |
| [310] | Reiter, R.1978. On closed world data bases. In Logic and Data Bases, H. Gallaire and J. Minker, Eds. Springer, 55-76. |
| [311] | Riguzzi, F.2007. A top down interpreter for LPAD and CP-logic. In Proceedings AI*IA 2007, R. Basili and M. T. Pazienza, Eds. Lecture Notes in Computer Science, vol. 4733. Springer, 109-120. |
| [312] | Riguzzi, F.2018. Foundations of Probabilistic Logic Programming. River Publishers. · Zbl 1420.68003 |
| [313] | Roberts, G. M.1977. An Implementation of PROLOG. Ph.D. thesis, University of Waterloo, Waterloo, Ontario, Canada. (Master Thesis). |
| [314] | Robinson, J. A.1965. A machine-oriented logic based on the resolution principle. Journal of the ACM 12, 1, 23-41. · Zbl 0139.12303 |
| [315] | Rocha, R., Silva, F. M. A. and Costa, V. S.2005. On applying or-parallelism and tabling to logic programs. Theory and Practice of Logic Programming 5, 1-2, 161-205. · Zbl 1093.68021 |
| [316] | Roussel, P.1972. Définition et traitement de l’égalité formelle en démonstration automatique. Ph.D. thesis, Faculté des Sciences de Luminy, Université Aix-Marseille II. |
| [317] | Roy, P. V., Haridi, S., Schulte, C. and Smolka, G.2020. A hmstory of the Oz multiparadigm language. In Proceedings HOPL. ACM, 83:1-83:56. |
| [318] | Homepage, Rust2021. Rust Programming Language. URL: https://www.rust-lang.org/. [Accessed 11 March, 2022]. |
| [319] | Sagonas, K., Swift, T. and Warren, D. S.1994. XSB as an efficient deductive database engine. SIGMOD 23, 2, 442-453. |
| [320] | Sagonas, K. F., Swift, T. and Warren, D. S.1993. The XSB programming system. In Proceedings Workshop on Programming with Logic Databases, R. Ramakrishnan, Ed. Technical Report, vol. #1183. University of Wisconsin, 164. |
| [321] | Sammut, C. and Sammut, R. A.1983. The implementation of UNSW-PROLOG. Australian Computer Journal 15, 2, 58-64. · Zbl 0515.68010 |
| [322] | Sanchez-Ordaz, M., Garcia-Contreras, I., Perez-Carrasco, V., Morales, J. F., Lopez-Garcia, P. and Hermenegildo, M. V.2021. Verifly: On-the-fly Assertion checking via incrementality. Theory and Practice of Logic Programming 21, 6, 768-784. · Zbl 1530.68059 |
| [323] | Santos Costa, V., Sagonas, K. F. and Lopes, R.2007. Demand-driven indexing of Prolog clauses. In Proceedings ICLP, V. Dahl and I. Niemelä, Eds. LNCS, vol. 4670. Springer, 395-409. |
| [324] | Sato, T.1995. A statistical learning method for logic programs with distribution semantics. In Proceedings ICLP, L. Sterling, Ed. MIT Press, 715-729. |
| [325] | Sato, T. and Kameya, Y.1997. PRISM: A language for symbolic-statistical modeling. In Proceedings IJCAI. Morgan Kaufmann, 1330-1339. |
| [326] | Schellhorn, G.1999. Verification of Abstract State Machines. Ph.D. thesis, Universität Ulm. |
| [327] | Schellhorn, G. and Ahrendt, W.1998. The WAM case study: Verifying compiler correctness for Prolog with KIV. In Automated Deduction—A Basis for Applications, W. Bibel and P. H. Schmitt, Eds. Applied Logic Series, vol. 10. Springer, 165-194. · Zbl 0977.68017 |
| [328] | Homepage, Schelog2018. The Schelog Language. URL: https://ds26gte.github.io/schelog/index.html. [Accessed 11 March, 2022]. |
| [329] | Schimpf, J. and Shen, K.2012. Ecl^ips^e - from LP to CLP. Theory and Practice of Logic Programming 12, 1-2, 127-156. · Zbl 1244.68020 |
| [330] | Schrijvers, T., Costa, V. S., Wielemaker, J. and Demoen, B.2008. Towards typed Prolog. In Proceedings ICLP, M. G. de la Banda and E. Pontelli, Eds. Lecture Notes in Computer Science, vol. 5366. Springer, 693-697. · Zbl 1185.68181 |
| [331] | Schrijvers, T. and Demoen, B.2008. Uniting the Prolog community. In Proceedings ICLP, M. G. de la Banda and E. Pontelli, Eds. Lecture Notes in Computer Science, vol. 5366. Springer, 7-8. |
| [332] | Schrijvers, T., Demoen, B., Desouter, B. and Wielemaker, J.2013. Delimited continuations for Prolog. Theory and Practice of Logic Programming 13, 4-5, 533-546. · Zbl 1312.68037 |
| [333] | Schrijvers, T. and Warren, D. S.2004. Constraint handling rules and tabled execution. In Proceedings ICLP, B. Demoen and V. Lifschitz, Eds. Lecture Notes in Computer Science, vol. 3132. Springer, 120-136. · Zbl 1104.68366 |
| [334] | Prolog, Scryer2021. Scryer Prolog. URL: https://github.com/mthom/scryer-prolog. [Accessed 11 March, 2022]. |
| [335] | Seo, J., Guo, S. and Lam, M. S.2015. SociaLite: An efficient graph query language based on datalog. IEEE Transactions on Knowledge and Data Engineering 27, 7, 1824-1837. |
| [336] | Serafini, L., Donadello, I. and D’Avila Garcez, A. S.2017. Learning and reasoning in logic tensor networks: Theory and application to semantic image interpretation. In Proceedings SAC, Seffah, A., Penzenstadler, B., Alves, C. and Peng, X., Eds. ACM, 125-130. |
| [337] | tu Prolog Home2021. tuProlog homepage. URL: http://tuprolog.unibo.it. [Accessed 11 March, 2022]. |
| [338] | Shapiro, E., Warren, D. H. D., Fuchi, K., Kowalski, R. A., Furukawa, K., Ueda, K., Kahn, K. M., Chikayama, T. and Tick, E.1993. The fifth generation project: Personal perspectives. Communications of the ACM 36, 3, 46-103. |
| [339] | Shapiro, E. Y.1983. A Subset of Concurrent Prolog and Its Interpreter. Tech. Rep. TR-003, ICOT, 1-4-28 Mita, Minato-ku Tokyo 108, Japan. |
| [340] | Shapiro, E. Y.1987. Concurrent PROLOG: Collected Papers. MIT Press. |
| [341] | Shen, W., Doan, A., Naughton, J. F. and Ramakrishnan, R.2007. Declarative information extraction using datalog with embedded extraction predicates. In Proceedings VLDB, C. Koch, J. Gehrke, M. N. Garofalakis, D. Srivastava, K. Aberer, A. Deshpande, D. Florescu, C. Y. Chan, V. Ganti, C. Kanne, W. Klas and E. J. Neuhold, Eds. ACM, 1033-1044. |
| [342] | SICS. 2021. Quintus Prolog Homepage. URL: https://quintus.sics.se/. [Accessed 11 March, 2022]. |
| [343] | SICStus Prolog Homepage2021. SICStus Prolog — leading Prolog technology. URL: https://sicstus.sics.se. [Accessed 11 March, 2022]. |
| [344] | Siek, J. G. and Taha, W.2006. Gradual typing for functional languages. In Scheme and Functional Programming Papers. University of Chicago, 81-92. TR-2006-06. |
| [345] | Simon, L., Mallya, A., Bansal, A. and Gupta, G.2006. Coinductive logic programming. In Proceedings ICLP, S. Etalle and M. Truszczynski, Eds. Lecture Notes in Computer Science, vol. 4079. Springer, 330-345. · Zbl 1131.68400 |
| [346] | Simpkins, N. K. and Hancox, P.1990. Chart parsing in Prolog. New Generation Computing 8, 2, 113-138. |
| [347] | Somogyi, Z., Henderson, F. and Conway, T. C.1996. The execution algorithm of mercury, an efficient purely declarative logic programming language. Journal of Logic Programming 29, 1-3, 17-64. · Zbl 0877.68015 |
| [348] | Sterling, L. and Shapiro, E. Y.1994. The Art of Prolog: Advanced Programming Techniques. MIT press. · Zbl 0850.68137 |
| [349] | Stickel, M. E.1984. A Prolog technology theorem prover. In Proceedings SLP. IEEE, 212-220. |
| [350] | Stickel, M. E.1992. A Prolog technology theorem prover: a new exposition and implementation in Prolog. Theoretical Computer Science 104, 1, 109-128. · Zbl 0771.68096 |
| [351] | Stulova, N., Morales, J. F. and Hermenegildo, M. V.2018. Exploiting term hiding to reduce run-time checking overhead. In Proceedings PADL, F. Calimeri, K. Hamlen and N. Leone, Eds. LNCS, vol. 10702. Springer, 99-115. |
| [352] | Sun, H., Arnold, A. O., Bedrax-Weiss, T., Pereira, F. and Cohen, W. W.2020. Faithful embeddings for knowledge base queries. In Proceedings NeurIPS, H. Larochelle, M. Ranzato, R. Hadsell, M. Balcan and H. Lin, Eds. NeurIPS.cc. |
| [353] | SWI-Prolog2021. SWI-Prolog — Manual. URL: https://www.swi-prolog.org/pldoc/man?section=implhistory. [Accessed 11 March, 2022]. |
| [354] | Prolog Homepage, Swi2021. SWI Prolog — robust, mature, free. Prolog for the real world. URL: https://www.swi-prolog.org. [Accessed 11 March, 2022]. |
| [355] | Swift, T.2009. Prolog-commons working group report. Association for Logic Programming Newsletter 22, 1. |
| [356] | Swift, T. and Warren, D. S.2012. XSB: Extending Prolog with tabled logic programming. Theory and Practice of Logic Programming 12, 1-2, 157-187. · Zbl 1244.68021 |
| [357] | Symonds, A. J.1986. Introduction to IBM’s knowledge-systems products. IBM Systems Journal 25, 2, 134-146. |
| [358] | Syrjänen, T. and Niemelä, I.2001. The Smodels system. In Proceedings LPNMR, T. Eiter, W. Faber and M. Truszczynski, Eds. Lecture Notes in Computer Science, vol. 2173. Springer, 434-438. · Zbl 1010.68797 |
| [359] | Szabó, P. and Szeredi, P.2006. Improving the ISO Prolog standard by analyzing compliance test results. In Proceedings ICLP, S. Etalle and M. Truszczynski, Eds. Lecture Notes in Computer Science, vol. 4079. Springer, 257-269. · Zbl 1131.68402 |
| [360] | Szeredi, P.2004. The early days of Prolog in hungary. Association for Logic Programming Newsletter 17, 4. |
| [361] | Tamaki, H. and Sato, T.1986. OLD resolution with tabulation. In Proceedings ICLP, E. Shapiro, Ed. Lecture Notes in Computer Science, vol. 225. Springer, 84-98. · Zbl 0607.68072 |
| [362] | Tarau, P.1992. BinProlog: A continuation passing style Prolog engine. In Proceedings PLILP, M. Bruynooghe and M. Wirsing, Eds. Lecture Notes in Computer Science, vol. 631. Springer, 479-480. |
| [363] | Tarau, P.2012. The BinProlog experience: Architecture and implementation choices for continuation passing Prolog and first-class logic engines. Theory and Practice of Logic Programming 12, 1-2, 97-126. · Zbl 1244.68022 |
| [364] | Tarau, P.2021. Natlog: A lightweight logic programming language with a neuro-symbolic touch. In Proceedings ICLP (Technical Communications), A. Formisano, Y. A. Liu, B. Bogaerts, A. Brik, V. Dahl, C. Dodaro, P. Fodor, G. L. Pozzato, J. Vennekens and N.-F. Zhou, Eds. EPTCS, vol. 345, 141-154. |
| [365] | \( \tau\) Prolog Homepage \(2021. \tau\) Prolog — an open source Prolog interpreter in javascript. URL: http://tau-prolog.org. [Accessed 11 March, 2022]. |
| [366] | comp.lang.Prolog FAQ 2021. URL: http://www.logic.at/prolog/faq/. [Accessed 11 March, 2022]. |
| [367] | Thom, J. and Zobel, J.1987. NU-Prolog Reference Manual. Department of Computer Science, University of Melbourne. |
| [368] | Tick, E.1984. Sequential Prolog machine: Image and host architectures. In Proceedings MICRO, M. Carter and R. A. Mueller, Eds. ACM/IEEE, 204-216. |
| [369] | Tolan, S., Miron, M., Gómez, E. and Castillo, C.2019. Why machine learning may lead to unfairness: Evidence from risk assessment for Juvenile Justice in Catalonia. In Proceedings ICAIL. ACM, 83-92. |
| [370] | Triska, M.2012. The finite domain constraint solver of SWI-Prolog. In Proceedings FLOPS, T. Schrijvers and P. Thiemann, Eds. Lecture Notes in Computer Science, vol. 7294. Springer, 307-316. |
| [371] | Triska, M.2021. The Power of Prolog. URL: https://www.metalevel.at/prolog. [Accessed 11 March, 2022]. · Zbl 1475.68056 |
| [372] | Triska, M., Neumerkel, U. and Wielemaker, J.2009. Better Termination for Prolog with Constraints. CoRR abs/0903.2168. |
| [373] | Ueda, K.1985. Guarded horn clauses. In Proceedings LP, E. Wada, Ed. Lecture Notes in Computer Science, vol. 221. Springer, 168-179. · Zbl 1497.68089 |
| [374] | Ueda, K. and Chikayama, T.1990. Design of the kernel language for the parallel inference machine. The Computer Journal 33, 6, 494-500. |
| [375] | Van Emden, M.2006. The early days of logic programming: A personal perspective. The Association of Logic Programming Newsletter 19, 3. |
| [376] | Van Emden, M. and Kowalski, R.1976. The semantics of predicate logic as a programming language. Journal of the ACM 23, 733-742. · Zbl 0339.68004 |
| [377] | Van Emden, M. and Lloyd, J.1984. A logical reconstruction of Prolog II. The Journal of Logic Programming 1, 2, 143-149. · Zbl 0594.68033 |
| [378] | Van Gelder, A., Ross, K. A. and Schlipf, J. S.1991. The well-founded semantics for general logic programs. Journal of the ACM 38, 3, 619-649. · Zbl 0799.68045 |
| [379] | Van Roy, P.1994. 1983-1993: The wonder years of sequential Prolog implementation. Journal of Logic Programming 19/20, 385-441. · Zbl 0817.68054 |
| [380] | Van Roy, P. and Despain, A.1992. High-performance logic programming with the aquarius Prolog compiler. IEEE Computer Magazine 25, 1, 54-68. |
| [381] | Vaz, D., Santos Costa, V. and Ferreira, M.2009. User defined indexing. In Proceedings ICLP, P. M. Hill and D. S. Warren, Eds. Lecture Notes in Computer Science, vol. 5649. Springer, 372-386. |
| [382] | Vennekens, J., Verbaeten, S. and Bruynooghe, M.2004. Logic programs with annotated disjunctions. In Proceedings ICLP, B. Demoen and V. Lifschitz, Eds. Lecture Notes in Computer Science, vol. 3132. Springer, 431-445. · Zbl 1104.68391 |
| [383] | Wallace, M. and Schimpf, J.1999. ECLiPSe: Declarative specification and scaleable implementation. In Proceedings PADL, G. Gupta, Ed. Lecture Notes in Computer Science, vol. 1551. Springer, 365-366. |
| [384] | Wallace, M. and Veron, A.1993. Two problems — two solutions: One system \(\text{ECL}^i\text{PS}^e\) . In Advanced Software Technologies for Scheduling. IET, 3/1-3/3. |
| [385] | Wang, Y. and Nadathur, G.2016. A Higher-Order Abstract Syntax Approach to Verified Transformations on Functional Programs. · Zbl 1335.68036 |
| [386] | Warren, D. H.1974. Warplan: A System for Generating Plans. Tech. Rep. 76, Dept. of Computational Logic, University of Edinburgh School of Artificial Intelligence. |
| [387] | Warren, D. H.1975. PROLOG to DEC 10 Machine Code Compiler. |
| [388] | Warren, D. H.1977. Applied Logic—Its Use and Implementation as Programming Tool. Ph.D. thesis, University of Edinburgh. Also available as SRI Technical Note 290. |
| [389] | Warren, D. H.1980. An improved Prolog implementation which optimizes tail recursion. Tech. Rep. 141, Dept. of Computational Logic, University of Edinburgh School of Artificial Intelligence. |
| [390] | Warren, D. H.1983. An Abstract Prolog Instruction Set. Tech. Rep. Technical Note 309, Artificial Intelligence Center, Computer Science and Technology Division, SRI International. |
| [391] | Warren, D. H.1990. The extended Andorra model with implicit control. Presented at ICLP’90 Workshop on Parallel Logic Programming. |
| [392] | Warren, D. H., Kornfeld, W. and Byrd, L.1984. Product Specifications. URL: http://www.softwarepreservation.org/projects/prolog/quintus/doc/Warren_et_al-Product_Specifications-1984_07.pdf. [Accessed 11 March, 2022]. |
| [393] | Warren, D. H. and Pereira, F. C.1982. An efficient easily adaptable system for interpreting natural language queries. Computational Linguistics 8, 3-4, 110-122. |
| [394] | Warren, D. H., Pereira, L. M. and Pereira, F. C.1977. Prolog—The language and its implementation compared with lisp. ACM SIGPLAN Notices 12, 8, 109-115. |
| [395] | Warren, D. S.1998. Programming with tabling in XSB. In Proceedings PROCOMET, D. Gries and W. P. de Roever, Eds. IFIPAICT, vol. 125. Chapman & Hall, 5-6. |
| [396] | Warren, R., Hermenegildo, M. and Debray, S. K.1988. On the practicality of global flow analysis of logic programs. In Proceedings ICLP/SLP, R. Kowalski and K. A. Bowen, Eds. MIT Press, 684-699. |
| [397] | Wenger, E., Mcdermott, R. A. and Snyder, W.2002. Cultivating Communities of Practice: A Guide to Managing Knowledge. Harvard Business Press. |
| [398] | Whaley, J., Avots, D., Carbin, M. and Lam, M. S.2005. Using datalog with binary decision diagrams for program analysis. In Proceedings APLAS, K. Yi, Ed. Lecture Notes in Computer Science, vol. 3780. Springer, 97-118. · Zbl 1159.68386 |
| [399] | Wielemaker, J. and Costa, V. S.2011. On the portability of Prolog applications. In Proceedings PADL, R. Rocha and J. Launchbury, Eds. Lecture Notes in Computer Science, vol. 1551. Springer, 69-83. |
| [400] | Wielemaker, J., Hildebrand, M., Van Ossenbruggen, J. and Schreiber, G.2008. Thesaurus-based search in large heterogeneous collections. In Proceedings ISWC, A. P. Sheth, S. Staab, M. Dean, M. Paolucci, D. Maynard, T. W. Finin and K. Thirunarayan, Eds. Lecture Notes in Computer Science, vol. 5318. Springer, 695-708. |
| [401] | Wielemaker, J., Huang, Z. and Van Der Meij, L.2008. SWI-Prolog and the web. Theory and Practice of Logic Programming 8, 3, 363-392. · Zbl 1139.68012 |
| [402] | Wielemaker, J., Riguzzi, F., Kowalski, R. A., Lager, T., Sadri, F. and Calejo, M.2019. Using SWISH to realize interactive web-based tutorials for logic-based languages. Theory and Practice of Logic Programming 19, 2, 229-261. · Zbl 1486.68029 |
| [403] | Wielemaker, J., Schrijvers, T., Triska, M. and Lager, T.2012. SWI-Prolog. Theory and Practice of Logic Programming 12, 1-2, 67-96. · Zbl 1244.68023 |
| [404] | Prolog Homepage, Xsb2021. Welcome to the home of XSB! URL: http://xsb.sourceforge.net. [Accessed 11 March, 2022]. |
| [405] | Zhou, N.-F.1996. Parameter passing and control stack management in Prolog implementation revisited. Transactions on Programming Languages and Systems 18, 6, 752-779. |
| [406] | Zhou, N.-F.2006. Programming finite-domain constraint propagators in action rules. Theory and Practice of Logic Programming 6, 5, 483-507. · Zbl 1122.68035 |
| [407] | Zhou, N.-F.2012. The language features and architecture of B-Prolog. Theory and Practice of Logic Programming 12, 1-2, 189-218. · Zbl 1244.68024 |
| [408] | Zhou, N.-F.2021. Modeling and solving graph synthesis problems using SAT-encoded reachability constraints in Picat. In Proceedings ICLP (Technical Communications), A. Formisano, Y. A. Liu, B. Bogaerts, A. Brik, V. Dahl, C. Dodaro, P. Fodor, G. L. Pozzato, J. Vennekens and N.-F. Zhou, Eds. EPTCS, vol. 345, 165-178. |
| [409] | Zhou, N.-F. and Fruhman, J.2021. A User’s Guide to Picat. URL: http://retina.inf.ufsc.br/picat_guide/. [Accessed 11 March, 2022]. |
| [410] | Zhou, N.-F., Kjellerstrand, H. and Fruhman, J.2015. Constraint Solving and Planning with Picat. SpringerBriefs in Intelligent Systems. Springer. |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
