{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,15]],"date-time":"2026-01-15T00:52:08Z","timestamp":1768438328931,"version":"3.49.0"},"reference-count":309,"publisher":"Cambridge University Press (CUP)","issue":"6","license":[{"start":{"date-parts":[[2022,3,28]],"date-time":"2022-03-28T00:00:00Z","timestamp":1648425600000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":["cambridge.org"],"crossmark-restriction":true},"short-container-title":["Theory and Practice of Logic Programming"],"published-print":{"date-parts":[[2022,11]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Multi-core and highly connected architectures have become ubiquitous, and this has brought renewed interest in language-based approaches to the exploitation of parallelism. Since its inception, logic programming has been recognized as a programming paradigm with great potential for automated exploitation of parallelism. The comprehensive survey of the first twenty years of research in parallel logic programming, published in 2001, has served since as a fundamental reference to researchers and developers. The contents are quite valid today, but at the same time the field has continued evolving at a fast pace in the years that have followed. Many of these achievements and ongoing research have been driven by the rapid pace of technological innovation, that has led to advances such as very large clusters, the wide diffusion of multi-core processors, the game-changing role of general-purpose graphic processing units, and the ubiquitous adoption of cloud computing. This has been paralleled by significant advances within logic programming, such as tabling, more powerful static analysis and verification, the rapid growth of Answer Set Programming, and in general, more mature implementations and systems. This survey provides a review of the research in parallel logic programming covering the period since 2001, thus providing a natural continuation of the previous survey. In order to keep the survey self-contained, it restricts its attention to parallelization of the major logic programming languages (Prolog, Datalog, Answer Set Programming) and with an emphasis on automated parallelization and preservation of the sequential observable semantics of such languages. The goal of the survey is to serve not only as a reference for researchers and developers of logic programming systems but also as engaging reading for anyone interested in logic and as a useful source for researchers in parallel systems outside logic programming.<\/jats:p>","DOI":"10.1017\/s1471068422000059","type":"journal-article","created":{"date-parts":[[2022,3,28]],"date-time":"2022-03-28T09:38:51Z","timestamp":1648460331000},"page":"905-973","update-policy":"https:\/\/doi.org\/10.1017\/policypage","source":"Crossref","is-referenced-by-count":6,"title":["Parallel Logic Programming: A Sequel"],"prefix":"10.1017","volume":"22","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2052-8593","authenticated-orcid":false,"given":"AGOSTINO","family":"DOVIER","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6755-9314","authenticated-orcid":false,"given":"ANDREA","family":"FORMISANO","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9727-0362","authenticated-orcid":false,"given":"GOPAL","family":"GUPTA","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7583-323X","authenticated-orcid":false,"given":"MANUEL V.","family":"HERMENEGILDO","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7753-1737","authenticated-orcid":false,"given":"ENRICO","family":"PONTELLI","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4502-8835","authenticated-orcid":false,"given":"RICARDO","family":"ROCHA","sequence":"additional","affiliation":[]}],"member":"56","published-online":{"date-parts":[[2022,3,28]]},"reference":[{"key":"S1471068422000059_ref204","doi-asserted-by":"crossref","unstructured":"Navas, J. , Bueno, F. and Hermenegildo, M. V. 2006. Efficient top-down set-sharing analysis using cliques. In 8th International Symposium on Practical Aspects of Declarative Languages (PADL\u201906). Lecture Notes in Computer Science, vol. 2819. Springer-Verlag, Heidelberg, Germany, 183\u2013198.","DOI":"10.1007\/11603023_13"},{"key":"S1471068422000059_ref26","doi-asserted-by":"crossref","unstructured":"Bu, Y. , Howe, B. , Balazinska, M. and Ernst, M. D. 2010. HaLoop: Efficient iterative data processing on large clusters. Proceedings of the VLDB Endowment 3, 1, 285\u2013296.","DOI":"10.14778\/1920841.1920881"},{"key":"S1471068422000059_ref193","doi-asserted-by":"crossref","unstructured":"M\u00e9ndez-Lojo, M. and Hermenegildo, M. V. 2008. Precise set sharing analysis for Java-style programs. In 9th International Conference on Verification, Model Checking and Abstract Interpretation (VMCAI\u201908). Lecture Notes in Computer Science, vol. 4905. Springer-Verlag, Heidelberg, Germany, 172\u2013187.","DOI":"10.1007\/978-3-540-78163-9_17"},{"key":"S1471068422000059_ref228","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068406002985"},{"key":"S1471068422000059_ref88","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2021.3080925"},{"key":"S1471068422000059_ref268","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068414000131"},{"key":"S1471068422000059_ref290","unstructured":"Warren, D. H. D. 1990. The extended Andorra model with implicit control. In Parallel Logic Programming Workshop, Sverker Jansson, Ed. SICS, Box 1263, S-163 13 Spanga, SWEDEN."},{"key":"S1471068422000059_ref267","doi-asserted-by":"crossref","unstructured":"Tachmazidis, I. and Antoniou, G. 2013. Computing the stratified semantics of logic programs over big data through mass parallelization. In Theory, Practice, and Applications of Rules on the Web - 7th International Symposium, RuleML 2013, L. Morgenstern, P. S. Stefaneas, F. L\u00e9vy, A. Z. Wyner and A. Paschke, Eds. Lecture Notes in Computer Science, vol. 8035. Springer, Heidelberg, Germany, 188\u2013202.","DOI":"10.1007\/978-3-642-39617-5_18"},{"key":"S1471068422000059_ref166","doi-asserted-by":"crossref","unstructured":"Liqat, U. , Kerrison, S. , Serrano, A. , Georgiou, K. , Lopez-Garcia, P. , Grech, N. , Hermenegildo, M. V. and Eder, K. 2014. Energy consumption analysis of programs based on XMOS ISA-level models. In Logic-Based Program Synthesis and Transformation, 23rd International Symposium, LOPSTR 2013, Revised Selected Papers, Gupta, G. and Pe\u00f1a, R. , Eds. Lecture Notes in Computer Science, vol. 8901. Springer, Heidelberg, Germany, 72\u201390.","DOI":"10.1007\/978-3-319-14125-1_5"},{"key":"S1471068422000059_ref22","unstructured":"Bone, P. 2011. Automatic parallelism in Mercury. In Technical Communications of the 27th International Conference on Logic Programming. LIPICS, vol. 11, 251\u2013254."},{"key":"S1471068422000059_ref33","unstructured":"Cabeza, D. and Hermenegildo, M. V. 1996. Implementing distributed concurrent constraint execution in the CIAO system. In Proceedings of the AGP\u201996 Joint Conference on Declarative Programming, 67\u201378."},{"key":"S1471068422000059_ref231","doi-asserted-by":"crossref","unstructured":"Rocha, R. , Silva, F. M. A. and Martins, R. 2003. YapDss: An Or-parallel Prolog system for scalable Beowulf clusters. In 11th Portuguese Conference on Artificial Intelligence, EPIA 2003. Springer Verlag, Heidelberg, Germany, 136\u2013150.","DOI":"10.1007\/978-3-540-24580-3_21"},{"key":"S1471068422000059_ref116","unstructured":"Gupta, G. and Jayaraman, B. 1990. On criteria for Or-parallel execution models of logic programs. In 1990 North American Conference on Logic Programming. MIT Press, Cambridge, MA, USA, 604\u2013623."},{"key":"S1471068422000059_ref143","unstructured":"Igne, F. , Dovier, A. and Pontelli, E. 2018. MASP-Reduce: A proposal for distributed computation of stable models. In Technical Communications of the 34th International Conference on Logic Programming. OASICS 64, Schloss Dagstuhl, 8:1\u20138:4."},{"key":"S1471068422000059_ref49","doi-asserted-by":"publisher","DOI":"10.1186\/1471-2105-12-98"},{"key":"S1471068422000059_ref67","volume-title":"Computer Science","volume":"864","author":"Debray","year":"1994"},{"key":"S1471068422000059_ref89","unstructured":"Formisano, A. and Vella, F. 2014. On multiple learning schemata in conflict driven solvers. In Proceedings of ICTCS, S. Bistarelli and A. Formisano, Eds. CEUR Workshop Proceedings, vol. 1231. CEUR-WS.org, Aachen, 133\u2013146."},{"key":"S1471068422000059_ref152","doi-asserted-by":"crossref","unstructured":"Klemen, M. , Lopez-Garcia, P. , Gallagher, J. P. , Morales, J. F. and Hermenegildo, M. V. 2020. A general framework for static cost analysis of parallel logic programs. In Proceedings of the 29th International Symposium on Logic-based Program Synthesis and Transformation (LOPSTR\u201919), M. Gabbrielli, Ed. Lecture Notes in Computer Science, vol. 12042. Springer-Verlag, Heidelberg, Germany, 19\u201335.","DOI":"10.1007\/978-3-030-45260-5_2"},{"key":"S1471068422000059_ref39","unstructured":"Carro, M. and Hermenegildo, M. V. 1999. Concurrency in Prolog using threads and a shared database. In 1999 International Conference on Logic Programming. MIT Press, Cambridge, MA, USA, 320\u2013334."},{"key":"S1471068422000059_ref188","author":"Marron","year":"2008"},{"key":"S1471068422000059_ref189","doi-asserted-by":"crossref","unstructured":"Marron, M. , M\u00e9ndez-Lojo, M. , Hermenegildo, M. V. , Stefanovic, D. and Kapur, D. 2008b. Sharing analysis of arrays, collections, and recursive structures. In ACM WS on Program Analysis for Software Tools and Engineering (PASTE\u201908). ACM, New York, 43\u201349.","DOI":"10.1145\/1512475.1512485"},{"key":"S1471068422000059_ref163","unstructured":"Lin, Z. 1989. Expected performance of the randomized parallel backtracking method. In Proceedings of the North American Conference on Logic Programming. The MIT Press, Cambridge, MA, USA, 677\u2013696."},{"key":"S1471068422000059_ref308","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-25883-6"},{"key":"S1471068422000059_ref123","doi-asserted-by":"publisher","DOI":"10.1145\/4472.4478"},{"key":"S1471068422000059_ref80","doi-asserted-by":"crossref","unstructured":"Ellguth, E. , Gebser, M. , Gusowski, M. , Kaufmann, B. , Kaminski, R. , Liske, S. , Schaub, T. , Schneidenbach, L. and Schnor, B. 2009. A simple distributed conflict-driven answer set solver. In Logic Programming and Non-Monotonic Reasoning. Springer Verlag, Heidelberg, Germany, 490\u2013495.","DOI":"10.1007\/978-3-642-04238-6_47"},{"key":"S1471068422000059_ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.parco.2005.03.004"},{"key":"S1471068422000059_ref114","doi-asserted-by":"crossref","unstructured":"Grebenshchikov, S. , Lopes, N. P. , Popeea, C. and Rybalchenko, A. 2012. Synthesizing software verifiers from proof rules. In ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI\u201912, J. Vitek, H. Lin and F. Tip, Eds. ACM, New York, 405\u2013416.","DOI":"10.1145\/2345156.2254112"},{"key":"S1471068422000059_ref10","unstructured":"Apache. 2020a. The Apache Software Foundation: Apache Hadoop. Tech. rep., URL: https:\/\/hadoop.apache.org\/."},{"key":"S1471068422000059_ref223","doi-asserted-by":"crossref","unstructured":"Pontelli, E. , Gupta, G. , Tang, D. , Carro, M. and Hermenegildo, M. V. 1996. Improving the efficiency of nondeterministic And\u2013parallel systems. The Computer Languages Journal 22, 2\/3, 115\u2013142.","DOI":"10.1016\/S0096-0551(96)00010-0"},{"key":"S1471068422000059_ref111","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2006.10.007"},{"key":"S1471068422000059_ref255","doi-asserted-by":"crossref","unstructured":"Shen, K. and Hermenegildo, M. V. 1996. Flexible scheduling for non-deterministic, And-parallel execution of logic programs. In Proceedings of EuroPar\u201996. Lecture Notes in Computer Science, vol. 1124. Springer-Verlag, Heidelberg, Germany, 635\u2013640.","DOI":"10.1007\/BFb0024759"},{"key":"S1471068422000059_ref236","doi-asserted-by":"crossref","unstructured":"Rocha, R. , Silva, F. M. A. and Santos Costa, V. 2005. On applying Or-parallelism and tabling to logic programs. Theory and Practice of Logic Programming 5, 1 & 2, 161\u2013205.","DOI":"10.1017\/S1471068404002030"},{"key":"S1471068422000059_ref57","unstructured":"Conway, T. 2002. Towards Parallel Mercury. Ph.D. thesis, University of Melbourne."},{"key":"S1471068422000059_ref35","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068418000364"},{"key":"S1471068422000059_ref165","doi-asserted-by":"crossref","unstructured":"Liqat, U. , Georgiou, K. , Kerrison, S. , Lopez-Garcia, P. , Hermenegildo, M. V. , Gallagher, J. P. and Eder, K. 2016. Inferring parametric energy consumption functions at different software levels: ISA vs. LLVM IR. In Foundational and Practical Aspects of Resource Analysis: 4th International Workshop, FOPARA 2015, London, UK, 11 April, 2015. Revised Selected Papers, M. V. Eekelen and U. D. Lago, Eds. Lecture Notes in Computer Science, vol. 9964. Springer, Heidelberg, Germany, 81\u2013100.","DOI":"10.1007\/978-3-319-46559-3_5"},{"key":"S1471068422000059_ref288","doi-asserted-by":"crossref","unstructured":"Wang, H. , Xiong, F. , Li, J. , Shi, S. , Li, J. and Gao, H. 2018. Data management on new processors: A survey. Parallel computing 72, 1\u201313.","DOI":"10.1016\/j.parco.2017.12.002"},{"key":"S1471068422000059_ref71","doi-asserted-by":"crossref","unstructured":"Desouter, B. , van Dooren, M. and Schrijvers, T. 2015. Tabling as a library with delimited control. Theory and Practice of Logic Programming 15, 4 & 5, 419\u2013433.","DOI":"10.1017\/S1471068415000137"},{"key":"S1471068422000059_ref254","doi-asserted-by":"crossref","unstructured":"Shen, K. 1996. Overview of DASWAM: Exploitation of dependent And-parallelism. Journal of Logic Programming 29, 1\/3, 245\u2013293.","DOI":"10.1016\/S0743-1066(96)00079-9"},{"key":"S1471068422000059_ref92","unstructured":"Fut\u00f3, I. 1993. Prolog with communicating processes: From T-Prolog to CSR-Prolog. In International Conference on Logic Programming. The MIT Press, Cambridge, MA, USA, 3\u201317."},{"key":"S1471068422000059_ref291","unstructured":"Warren, D. S. 1984. Efficient Prolog memory management for flexible control strategies. In International Symposium on Logic Programming. IEEE Computer Society, USA, 198\u2013203."},{"key":"S1471068422000059_ref153","doi-asserted-by":"crossref","unstructured":"Klemen, M. , Stulova, N. , Lopez-Garcia, P. , Morales, J. F. and Hermenegildo, M. V. 2018. Static performance guarantees for programs with run-time checks. In 20th International ACM SIGPLAN Symposium on Principles and Practice of Declarative Programming (PPDP\u201918). ACM Press, New York.","DOI":"10.1145\/3236950.3236970"},{"key":"S1471068422000059_ref206","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2009.11.015"},{"key":"S1471068422000059_ref45","author":"Chico de Guzm\u00e1n","year":"2008"},{"key":"S1471068422000059_ref258","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(02)00187-X"},{"key":"S1471068422000059_ref162","author":"Li","year":"2006"},{"key":"S1471068422000059_ref5","doi-asserted-by":"publisher","DOI":"10.1007\/BF01407834"},{"key":"S1471068422000059_ref84","doi-asserted-by":"crossref","unstructured":"Flanagan, C. and Felleisen, M. 1995. The semantics of Future and its use in program optimization. In Conference Record of POPL\u201995: 22nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, San Francisco, California, USA, 23\u201325 January 1995, Cytron, R. K. and Lee, P. , Eds. ACM Press, 209\u2013220.","DOI":"10.1145\/199448.199484"},{"key":"S1471068422000059_ref292","unstructured":"Warren, R. , Hermenegildo, M. V. and Debray, S. K. 1988. On the practicality of global flow analysis of logic programs. In Fifth International Conference and Symposium on Logic Programming. MIT Press, Cambridge, MA, USA, 684\u2013699."},{"key":"S1471068422000059_ref229","doi-asserted-by":"crossref","unstructured":"Puebla, G. and Hermenegildo, M. V. 1999. Abstract multiple specialization and its application to program parallelization. Journal of Logic Programming 41, 2&3, 279\u2013316.","DOI":"10.1016\/S0743-1066(99)00031-X"},{"key":"S1471068422000059_ref42","doi-asserted-by":"crossref","unstructured":"Casas, A. , Carro, M. and Hermenegildo, M. V. 2008a. A high-level implementation of non-deterministic, unrestricted, independent And-parallelism. In 24th International Conference on Logic Programming (ICLP\u201908), M. Garc\u00eda de la Banda and E. Pontelli, Eds. Lecture Notes in Computer Science, vol. 5366. Springer-Verlag, Heidelberg, Germany, 651\u2013666.","DOI":"10.1007\/978-3-540-89982-2_53"},{"key":"S1471068422000059_ref73","author":"Dovier","year":"2018"},{"key":"S1471068422000059_ref202","doi-asserted-by":"crossref","unstructured":"Muthukumar, K. and Hermenegildo, M. V. 1992. Compile-time derivation of variable dependency using abstract interpretation. Journal of Logic Programming 13, 2\/3, 315\u2013347.","DOI":"10.1016\/0743-1066(92)90035-2"},{"key":"S1471068422000059_ref65","unstructured":"De Bortoli, M. , Igne, F. , Tardivo, F. , Totis, P. , Dovier, A. and Pontelli, E. 2019. Towards distributed computation of answer sets. In Proceedings of the 34th Italian Conference on Computational Logic. CEUR Workshop Proceedings, vol. 2396. CEUR-WS.org, Aachen, 316\u2013326."},{"key":"S1471068422000059_ref68","unstructured":"Debray, S. K. , Lopez-Garcia, P. , Hermenegildo, M. V. and Lin, N.-W. 1997. Lower bound cost estimation for logic programs. In 1997 International Logic Programming Symposium. MIT Press, Cambridge, MA, USA, 291\u2013305."},{"key":"S1471068422000059_ref130","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-8191(00)00051-X"},{"key":"S1471068422000059_ref215","unstructured":"Pollard, G. H. 1981. Parallel Execution of Horn Clause Programs. Ph.D. thesis, Imperial College, London. Department of Computing."},{"key":"S1471068422000059_ref139","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068414000015"},{"key":"S1471068422000059_ref269","unstructured":"Tachmazidis, I. , Antoniou, G. , Flouris, G. , Kotoulas, S. and McCluskey, L. 2012. Large-scale parallel stratified defeasible reasoning. In European Conference on Artificial Intelligence (ECAI). IOS Press."},{"key":"S1471068422000059_ref128","unstructured":"Hermenegildo, M. V. 1986a. An Abstract Machine Based Execution Model for Computer Architecture Design and Efficient Implementation of Logic Programs in Parallel. Ph.D. thesis, University of Texas at Austin."},{"key":"S1471068422000059_ref212","doi-asserted-by":"crossref","unstructured":"Pereira, L. M. , Monteiro, L. , Cunha, J. and Aparcio, J. N. 1986. Delta Prolog: A distributed backtracking extension with events. In International Conference on Logic Programming, E. Shapiro, Ed. Lecture Notes in Computer Science, vol. 225. Springer Verlag, Heidelberg, Germany, 69\u201383.","DOI":"10.1007\/3-540-16492-8_65"},{"key":"S1471068422000059_ref233","author":"Rocha","year":"1999"},{"key":"S1471068422000059_ref301","unstructured":"Zeuch, S. 2018. Query Execution on Modern CPUs. Ph.D. thesis, Humboldt University of Berlin, Germany."},{"key":"S1471068422000059_ref79","volume-title":"Workshop on Parallelism and Implementation Technologies for (Constraint) Logic Programming Languages","author":"El-Khatib","year":"2000"},{"key":"S1471068422000059_ref117","unstructured":"Gupta, G. and Pontelli, E. 1997. Extended dynamic dependent and-parallelism in ACE. In Proceedings of the 2nd International Workshop on Parallel Symbolic Computation, PASCO 1997, 20\u201322 July 1997, Kihei, Hawaii, USA, H. Hong, E. Kaltofen and M. A. Hitz, Eds. ACM, New York, 68\u201379."},{"key":"S1471068422000059_ref21","unstructured":"Bonatti, P. , Pontelli, E. and Son, T. C. 2008. Credulous resolution for answer set programming. In National Conference on Artificial Intelligence (AAAI). AAAI Press, 418\u2013423."},{"key":"S1471068422000059_ref48","unstructured":"Chin, B. , von Dincklage, D. , Ercegovac, V. , Hawkins, P. , Miller, M. S. , Och, F. J. , Olston, C. and Pereira, F. 2015. Yedalog: Exploring knowledge at scale. In 1st Summit on Advances in Programming Languages, SNAPL 2015, 3\u20136 May 2015, Asilomar, California, USA, T. Ball, R. Bod\u00edk, S. Krishnamurthi, B. S. Lerner and G. Morrisett, Eds. LIPICS, vol. 32. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 63\u201378."},{"key":"S1471068422000059_ref6","unstructured":"Ali, K. A. M. and Karlsson, R. 1990b. The Muse Or-parallel Prolog model and its performance. In 1990 North American Conference on Logic Programming. MIT Press, Cambridge, MA, USA, 757\u2013776."},{"key":"S1471068422000059_ref303","doi-asserted-by":"publisher","DOI":"10.1109\/69.368511"},{"key":"S1471068422000059_ref178","unstructured":"Maiterth, M. 2012. Parallel Datalog on Pregel. M.S. thesis, Ludwig-Maximilians Universitat Munchen."},{"key":"S1471068422000059_ref274","unstructured":"Trigo de la Vega, T. , Lopez-Garc\u00eda, P. and Mu\u00f1oz-Hern\u00e1ndez, S. 2010. Towards fuzzy granularity control in parallel\/distributed computing. In International Conference on Fuzzy Computation (ICFC 2010). SciTePress, 43\u201355."},{"key":"S1471068422000059_ref169","doi-asserted-by":"crossref","unstructured":"Lopes, R. , Santos Costa, V. and Silva, F. M. A. 2003. On the BEAM implementation. In 11th Portuguese Conference on Artificial Intelligence, EPIA 2003. Springer Verlag, Heidelberg, Germany, 131\u2013135.","DOI":"10.1007\/978-3-540-24580-3_20"},{"key":"S1471068422000059_ref106","doi-asserted-by":"publisher","DOI":"10.3233\/AIC-2011-0491"},{"key":"S1471068422000059_ref284","unstructured":"Villaverde, K. and Pontelli, E. 2004. An investigation of scheduling in distributed constraint logic programming. In Proceedings of the ISCA 17th International Conference on Parallel and Distributed Computing Systems. ISCA, 98\u2013103."},{"key":"S1471068422000059_ref158","volume-title":"In Euro-Par","author":"Le","year":"2005"},{"key":"S1471068422000059_ref181","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068413000094"},{"key":"S1471068422000059_ref195","volume-title":"Computer Science","volume":"4915","author":"M\u00e9ndez-Lojo","year":"2007"},{"key":"S1471068422000059_ref122","doi-asserted-by":"publisher","DOI":"10.1145\/42411.42415"},{"key":"S1471068422000059_ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.jss.2016.06.060"},{"key":"S1471068422000059_ref280","first-page":"620","article-title":"The well-founded semantics for general logic programs","volume":"3","author":"Van Gelder","year":"1991","journal-title":"Journal of the ACM 38"},{"key":"S1471068422000059_ref93","doi-asserted-by":"publisher","DOI":"10.1016\/0141-9331(89)90136-1"},{"key":"S1471068422000059_ref190","author":"Martinez-Angeles","year":"2014"},{"key":"S1471068422000059_ref98","doi-asserted-by":"crossref","unstructured":"Garcia-Contreras, I. , Morales, J. F. and Hermenegildo, M. V. 2020. Incremental analysis of logic programs with assertions and open predicates. In Proceedings of the 29th International Symposium on Logic-based Program Synthesis and Transformation (LOPSTR\u201919). Lecture Notes in Computer Science. Springer-Verlag, Heidelberg, Germany, 36\u201356.","DOI":"10.1007\/978-3-030-45260-5_3"},{"key":"S1471068422000059_ref172","unstructured":"Lopez-Garcia, P. 2000. Non-failure Analysis and Granularity Control in Parallel Execution of Logic Programs. Ph.D. thesis, Universidad Polit\u00e9cnica de Madrid (UPM), Facultad Informatica UPM, 28660-Boadilla del Monte, Madrid-Spain."},{"key":"S1471068422000059_ref62","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068419000358"},{"key":"S1471068422000059_ref306","doi-asserted-by":"crossref","unstructured":"Zhou, N.-F. 2012. The language features and architecture of B-Prolog. Theory and Practice of Logic Programming 12, 1 & 2, 189\u2013218.","DOI":"10.1017\/S1471068411000445"},{"key":"S1471068422000059_ref137","first-page":"1","article-title":"Strict and non-strict independent and-parallelism in logic programs: Correctness, efficiency, and compile-time conditions","volume":"1","author":"Hermenegildo","year":"1995","journal-title":"Journal of Logic Programming 22"},{"key":"S1471068422000059_ref252","doi-asserted-by":"publisher","DOI":"10.1145\/72551.72555"},{"key":"S1471068422000059_ref287","doi-asserted-by":"crossref","unstructured":"Villaverde, K. , Pontelli, E. , Guo, H.-F. and Gupta, G. 2003. A methodology for order-sensitive execution of non-deterministic languages on Beowulf platforms. In Euro-Par 2003. Parallel Processing, 9th International Euro-Par Conference. Springer Verlag, Heidelberg, Germany, 694\u2013703.","DOI":"10.1007\/978-3-540-45209-6_98"},{"key":"S1471068422000059_ref161","doi-asserted-by":"crossref","unstructured":"Leutgeb, L. and Weinzierl, A. 2017. Techniques for efficient lazy-grounding ASP solving. In Declarative Programming and Knowledge Management - Conference on Declarative Programming. Lecture Notes in Computer Science, vol. 10997. Springer, Heidelberg, Germany, 132\u2013148.","DOI":"10.1007\/978-3-030-00801-7_9"},{"key":"S1471068422000059_ref87","doi-asserted-by":"crossref","unstructured":"Formisano, A. , Gentilini, R. and Vella, F. 2017. Accelerating energy games solvers on modern architectures. In Proceedings of the 7th Workshop on Irregular Applications: Architectures and Algorithms, IA3@SC. ACM, New York, 12:1\u201312:4.","DOI":"10.1145\/3149704.3149771"},{"key":"S1471068422000059_ref76","doi-asserted-by":"crossref","unstructured":"Dovier, A. , Formisano, A. and Vella, F. 2019. GPU-based parallelism for ASP-solving. In Declarative Programming and Knowledge Management - Conference on Declarative Programming, DECLARE 2019, Unifying INAP, WLP, and WFLP, Cottbus, Germany, 9\u201312 September 2019, Revised Selected Papers, P. Hofstedt, S. Abreu, U. John, H. Kuchen and D. Seipel, Eds. Lecture Notes in Computer Science, vol. 12057. Springer, Heidelberg, Germany, 3\u201323.","DOI":"10.1007\/978-3-030-46714-2_1"},{"key":"S1471068422000059_ref37","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068411000482"},{"key":"S1471068422000059_ref102","first-page":"269","article-title":"Independence in CLP languages","volume":"2","author":"Garc\u00eda de la Banda","year":"2000","journal-title":"ACM Transactions on Programming Languages and Systems 22"},{"key":"S1471068422000059_ref44","doi-asserted-by":"publisher","DOI":"10.1145\/227595.227597"},{"key":"S1471068422000059_ref29","doi-asserted-by":"crossref","unstructured":"Bueno, F. and Garc\u00eda de la Banda, M. 2004. Set-sharing is not always redundant for pair-sharing. In 7th International Symposium on Functional and Logic Programming (FLOPS 2004). Lecture Notes in Computer Science, vol. 2998. Springer-Verlag, Heidelberg, Germany, 117\u2013131.","DOI":"10.1007\/978-3-540-24754-8_10"},{"key":"S1471068422000059_ref156","volume-title":"Logic for Problem Solving","author":"Kowalski","year":"1979"},{"key":"S1471068422000059_ref151","unstructured":"Khronos Group Inc. 2015. OpenCL: The open standard for parallel programming of heterogeneous systems. URL: http:\/\/www.khronos.org."},{"key":"S1471068422000059_ref129","doi-asserted-by":"crossref","unstructured":"Hermenegildo, M. V. 1986b. An abstract machine for restricted And-parallel execution of logic programs. In Third International Conference on Logic Programming. Lecture Notes in Computer Science, vol. 225. Imperial College, Springer-Verlag, Heidelberg, Germany, 25\u201340.","DOI":"10.1007\/3-540-16492-8_62"},{"key":"S1471068422000059_ref282","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068412000191"},{"key":"S1471068422000059_ref25","doi-asserted-by":"publisher","DOI":"10.1017\/S147106840100103X"},{"key":"S1471068422000059_ref235","volume-title":"Computer Science","volume":"2237","author":"Rocha","year":"2001"},{"key":"S1471068422000059_ref32","unstructured":"Cabeza, D. 2004. An Extensible, Global Analysis Friendly Logic Programming System. Ph.D. thesis, Universidad Polit\u00e9cnica de Madrid (UPM), Facultad Informatica UPM, 28660-Boadilla del Monte, Madrid-Spain."},{"key":"S1471068422000059_ref2","doi-asserted-by":"crossref","unstructured":"Afrati, F. N. and Ullman, J. D. 2010. Optimizing joins in a Map-Reduce environment. In 13th International Conference on Extending Database Technology. ACM, New York, 99\u2013110.","DOI":"10.1145\/1739041.1739056"},{"key":"S1471068422000059_ref247","doi-asserted-by":"crossref","unstructured":"Schneidenbach, L. , Schnor, B. , Gebser, M. , Kaminski, R. , Kaufmann, B. and Schaub, T. 2009. Experiences running a parallel answer set solver on blue gene. In 16th European PVM\/MPI Users\u2019 Group Meeting. Springer Verlag, Heidelberg, Germany, 64\u201372.","DOI":"10.1007\/978-3-642-03770-2_13"},{"key":"S1471068422000059_ref203","doi-asserted-by":"crossref","unstructured":"Nappa, P. , Zhao, D. , Subotic, P. and Scholz, B. 2019. Fast parallel equivalence relations in a Datalog compiler. In 28th International Conference on Parallel Architectures and Compilation Techniques, PACT 2019, Seattle, WA, USA, 23\u201326 September 2019. IEEE, USA, 82\u201396.","DOI":"10.1109\/PACT.2019.00015"},{"key":"S1471068422000059_ref140","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068414000210"},{"key":"S1471068422000059_ref278","unstructured":"Ullman, J. D. 2010. Cluster computing and Datalog. In Datalog 2.0: The Resurgence of Datalog in Academia and Industry. URL: http:\/\/datalog20.org\/."},{"key":"S1471068422000059_ref51","unstructured":"Citrigno, S. , Eiter, T. , Faber, W. , Gottlob, G. , Koch, C. , Leone, N. , Mateis, C. , Pfeifer, G. and Scarcello, F. 1997. The DLV system: Model generator and application frontends. In Twelfth Workshop Logic Programming, WLP 1997, 17\u201319 September 1997, M\u00fcnchen, Germany, Technical Report PMS-FB-1997-10. Ludwig Maximilians Universit\u00e4t M\u00fcnchen, 128\u2013137."},{"key":"S1471068422000059_ref237","doi-asserted-by":"crossref","unstructured":"Rui, R. and Tu, Y. 2017. Fast equi-join algorithms on GPUs: Design and implementation. In Proceedings of the 29th International Conference on Scientific and Statistical Database Management, Chicago, IL, USA, 27\u201329 June 2017. ACM, New York, 17:1\u201317:12.","DOI":"10.1145\/3085504.3085521"},{"key":"S1471068422000059_ref279","doi-asserted-by":"publisher","DOI":"10.1016\/j.websem.2011.05.004"},{"key":"S1471068422000059_ref276","first-page":"1928","article-title":"Applications of parallel processing technologies in heuristic search planning: Methodologies and experiments","volume":"15","author":"Tu","year":"2009","journal-title":"Concurrency and Computation: Practice and Experience 21"},{"key":"S1471068422000059_ref184","doi-asserted-by":"crossref","unstructured":"Marriott, K. , Garc\u00eda de la Banda, M. and Hermenegildo, M. V. 1994. Analyzing logic programs with dynamic scheduling. In 20th Annual ACM Conference on Principles of Programming Languages. ACM, New York, 240\u2013254.","DOI":"10.1145\/174675.177883"},{"key":"S1471068422000059_ref54","doi-asserted-by":"publisher","DOI":"10.1016\/S0743-1066(99)00007-2"},{"key":"S1471068422000059_ref34","first-page":"4704","article-title":"Non-strict independence-based program parallelization using sharing and freeness information","volume":"46","author":"Cabeza","year":"2009","journal-title":"Theoretical Computer Science 410"},{"key":"S1471068422000059_ref133","unstructured":"Hermenegildo, M. V. , Cabeza, D. and Carro, M. 1995. Using attributed variables in the implementation of concurrent and parallel logic programming systems. In ICLP\u201995. MIT Press, Cambridge, MA, USA, 631\u2013645."},{"key":"S1471068422000059_ref94","doi-asserted-by":"crossref","unstructured":"Gallagher, J. P. , Hermenegildo, M. V. , Kafle, B. , Klemen, M. , Lopez-Garcia, P. and Morales, J. F. 2020. From big-step to small-step semantics and back with interpreter specialization (invited paper). In International WS on Verification and Program Transformation (VPT 2020). EPTCS. Open Publishing Association, 50\u201365.","DOI":"10.4204\/EPTCS.320.4"},{"key":"S1471068422000059_ref260","first-page":"150","author":"Somogyi","year":"2006"},{"key":"S1471068422000059_ref9","doi-asserted-by":"crossref","unstructured":"Amdahl, G. M. 1967. Validity of the single processor approach to achieving large scale computing capabilities. In Proceedings of the AFIPS\u201967 Spring Joint Computer Conference. AFIPS Conference Proceedings, vol. 30. AFIPS\/ACM\/Thomson Book Company, Washington DC, 483\u2013485.","DOI":"10.1145\/1465482.1465560"},{"key":"S1471068422000059_ref11","unstructured":"Apache. 2020b. The Apache Software Foundation: GraphX programming guide. Tech. rep., URL: http:\/\/spark.apache.org\/docs\/latest\/graphx-programming-guide.html."},{"key":"S1471068422000059_ref182","author":"Marques","year":"2008"},{"key":"S1471068422000059_ref82","author":"Fecht","year":"1996"},{"key":"S1471068422000059_ref56","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068418000418"},{"key":"S1471068422000059_ref261","unstructured":"Son, T. C. and Pontelli, E. 2007. Planning for biochemical pathways: A case study of answer set planning in large planning problem instances. In Proceedings of the First International SEA\u201907 Workshop, Tempe, Arizona, USA, 14 May 2007, M. D. Vos and T. Schaub, Eds. CEUR Workshop Proceedings, vol. 281. CEUR-WS.org, Aachen."},{"key":"S1471068422000059_ref207","doi-asserted-by":"crossref","unstructured":"Navas, J. , Mera, E. , Lopez-Garcia, P. and Hermenegildo, M. V. 2007. User-definable resource bounds analysis for logic programs. In Proceedings of ICLP\u201907. Lecture Notes in Computer Science, vol. 4670. Springer, Heidelberg, Germany, 348\u2013363.","DOI":"10.1007\/978-3-540-74610-2_24"},{"key":"S1471068422000059_ref108","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068419000061"},{"key":"S1471068422000059_ref249","doi-asserted-by":"crossref","unstructured":"Seo, J. , Park, J. , Shin, J. and Lam, M. S. 2013. Distributed SociaLite: A Datalog-based language for large-scale graph analysis. Proceedings of the VLDB Endowment 6, 14, 1906\u20131917.","DOI":"10.14778\/2556549.2556572"},{"key":"S1471068422000059_ref246","unstructured":"Santos Costa, V. , Warren, D. H. D. and Yang, R. 1991c. The Andorra-I preprocessor: Supporting full Prolog on the basic Andorra model. In Proceedings of the International Conference on Logic Programming, K. Furukawa, Ed. Press, MIT , Cambridge, MA , USA, 443\u2013456."},{"key":"S1471068422000059_ref150","first-page":"188","article-title":"A practical object-oriented analysis engine for CLP","volume":"2","author":"Kelly","year":"1998","journal-title":"Software: Practice and Experience 28"},{"key":"S1471068422000059_ref270","unstructured":"Tarzariol, A. 2019. Evolution of algorithm portfolio for solving strategies. In Proceedings of the 34th Italian Conference on Computational Logic, Trieste, Italy, 19\u201321 June 2019, A. Casagrande and E. G. Omodeo, Eds. CEUR Workshop Proceedings, vol. 2396. CEUR-WS.org, Aachen, 327\u2013341."},{"key":"S1471068422000059_ref209","doi-asserted-by":"crossref","unstructured":"Niemela, I. and Simons, P. 1997. Smodels - an implementation of the stable model and well-founded semantics for normal LP. In Logic Programming and Non-monotonic Reasoning. Springer Verlag, Heidelberg, Germany, 421\u2013430.","DOI":"10.1007\/3-540-63255-7_32"},{"key":"S1471068422000059_ref66","doi-asserted-by":"crossref","unstructured":"Debray, S. K. , Lin, N.-W. and Hermenegildo, M. V. 1990. Task granularity analysis in logic programs. In Proceedings of the 1990 ACM Conference on Programming Language Design and Implementation (PLDI). ACM Press, New York, 174\u2013188.","DOI":"10.1145\/93542.93564"},{"key":"S1471068422000059_ref149","volume-title":"Learning Spark","author":"Karau","year":"2015"},{"key":"S1471068422000059_ref99","unstructured":"Garc\u00eda de la Banda, M. 1994. Independence, Global Analysis, and Parallelism in Dynamically Scheduled Constraint Logic Programming. Ph.D. thesis, Universidad Politecnica de Madrid."},{"key":"S1471068422000059_ref208","doi-asserted-by":"crossref","unstructured":"Nguyen, H. D. , Sakama, C. , Sato, T. and Inoue, K. 2018. Computing logic programming semantics in linear algebra. In Multi-disciplinary Trends in Artificial Intelligence - 12th International Conference, MIWAI 2018, Hanoi, Vietnam, 18\u201320 November 2018, Proceedings, Kaenampornpan, M. , Malaka, R. , Nguyen, D. D. and Schwind, N. , Eds. Lecture Notes in Computer Science, vol. 11248. Springer, Heidelberg, Germany, 32\u201348.","DOI":"10.1007\/978-3-030-03014-8_3"},{"key":"S1471068422000059_ref256","unstructured":"Shkapsky, A. 2016. A Declarative Language for Advanced Analytics and its Scalable Implementation. Ph.D. thesis, University of California, Los Angeles, USA."},{"key":"S1471068422000059_ref72","doi-asserted-by":"crossref","unstructured":"Diamos, G. F. , Wu, H. , Wang, J. , Lele, A. and Yalamanchili, S. 2013. Relational algorithms for multi-bulk-synchronous processors. In ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPoPP\u201913, Shenzhen, China, 23\u201327 February 2013, A. Nicolau, X. Shen, S. P. Amarasinghe and R. W. Vuduc, Eds. ACM, New York, 301\u2013302.","DOI":"10.1145\/2442516.2442555"},{"key":"S1471068422000059_ref259","unstructured":"Singhal, A. and Patt, Y. N. 1989. Unification parallelism: How much can we exploit? In Proceedings of the North American Conference on Logic Programming, E. Lusk and R. Overbeek, Eds. MIT Press, Cambridge, MA, USA, 1135\u20131147."},{"key":"S1471068422000059_ref91","author":"Freire","year":"1996"},{"key":"S1471068422000059_ref205","unstructured":"Navas, J. , M\u00e9ndez-Lojo, M. and Hermenegildo, M. V. 2008. Safe upper-bounds inference of energy consumption for Java bytecode applications. In The Sixth NASA Langley Formal Methods Workshop (LFM 08). NASA Langley Research Center, Hampton, Virginia, USA, 29\u201332. Extended Abstract."},{"key":"S1471068422000059_ref55","doi-asserted-by":"crossref","unstructured":"Codish, M. and Shapiro, E. Y. 1986. Compiling Or-parallelism into And-parallelism. In Third International Conference on Logic Programming. Lecture Notes in Computer Science, vol. 225. Imperial College, Springer-Verlag, Heidelberg, Germany, 283\u2013298.","DOI":"10.1007\/3-540-16492-8_82"},{"key":"S1471068422000059_ref4","doi-asserted-by":"crossref","unstructured":"Albert, E. , Arenas, P. , Genaim, S. , Puebla, G. and Zanardini, D. 2007. Cost analysis of Java bytecode. In 16th European Symposium on Programming, ESOP\u201907, R. D. Nicola, Ed. Notes, Lecture in Computer Science, vol. 4421. Springer, Heidelberg, Germany, 157\u2013172.","DOI":"10.1007\/978-3-540-71316-6_12"},{"key":"S1471068422000059_ref119","doi-asserted-by":"publisher","DOI":"10.1145\/504083.504085"},{"key":"S1471068422000059_ref104","volume-title":"Synthesis Lectures on Artificial Intelligence and Machine Learning","author":"Gebser","year":"2012"},{"key":"S1471068422000059_ref136","doi-asserted-by":"crossref","unstructured":"Hermenegildo, M. V. , 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\u20132, 115\u2013140.","DOI":"10.1016\/j.scico.2005.02.006"},{"key":"S1471068422000059_ref105","doi-asserted-by":"crossref","unstructured":"Gebser, M. , Kaminski, R. , Kaufmann, B. , Schaub, T. , Schneider, M. T. and Ziller, S. 2011a. A portfolio solver for answer set programming: Preliminary report. In Logic Programming and Nonmonotonic Reasoning - 11th International Conference, LPNMR 2011, Vancouver, Canada, 16\u201319 May 2011. Proceedings, J. P. Delgrande and W. Faber, Eds. Lecture Notes in Computer Science, vol. 6645. Springer, Heidelberg, Germany, 352\u2013357.","DOI":"10.1007\/978-3-642-20895-9_40"},{"key":"S1471068422000059_ref227","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2006.05.002"},{"key":"S1471068422000059_ref27","unstructured":"Bueno, F. , Debray, S. K. , Garc\u00eda de la Banda, M. and Hermenegildo, M. V. 1994. QE-Andorra: A Quiche\u2013Eating implementation of the basic Andorra model. Technical Report CLIP13\/94.0, TU of Madrid (UPM)."},{"key":"S1471068422000059_ref50","author":"Ciancarini","year":"1990"},{"key":"S1471068422000059_ref265","doi-asserted-by":"publisher","DOI":"10.1016\/j.scico.2017.12.006"},{"key":"S1471068422000059_ref179","doi-asserted-by":"crossref","unstructured":"Malewicz, G. , Austern, M. H. , Bik, A. J. C. , Dehnert, J. C. , Horn, I. , Leiser, N. and Czajkowski, G. 2010. Pregel: A system for large-scale graph processing. In Proceedings of the ACM SIGMOD International Conference on Management of Data, SIGMOD 2010, Indianapolis, Indiana, USA, 6\u201310 June 2010, A. K. Elmagarmid and D. Agrawal, Eds. ACM, New York, 135\u2013146.","DOI":"10.1145\/1807167.1807184"},{"key":"S1471068422000059_ref41","doi-asserted-by":"crossref","unstructured":"Casas, A. , Carro, M. and Hermenegildo, M. V. 2007. Annotation algorithms for unrestricted independent And-parallelism in logic programs. In 17th International Symposium on Logic-based Program Synthesis and Transformation (LOPSTR\u201907). Lecture Notes in Computer Science, vol. 4915. Springer-Verlag, The Technical University of Denmark, 138\u2013153.","DOI":"10.1007\/978-3-540-78769-3_10"},{"key":"S1471068422000059_ref23","unstructured":"Bone, P. 2012. Automatic Parallelization for Mercury. Ph.D. thesis, University of Melbourne."},{"key":"S1471068422000059_ref170","unstructured":"Lopes, R. , Santos Costa, V. and Silva, F. M. A. 2004. Exploiting parallelism in the extended Andorra model. In Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Networks. IASTED\/ACTA, 483\u2013489."},{"key":"S1471068422000059_ref118","unstructured":"Gupta, G. and Pontelli, E. 1999. Stack-splitting: A simple technique for implementing Or-parallelism and And-parallelism on distributed machines. In International Conference on Logic Programming, D. De Schreye, Ed. MIT Press, Cambridge, MA, USA, 290\u2013304."},{"key":"S1471068422000059_ref263","unstructured":"Stulova, N. 2018. Improving Run-Time Checking in Dynamic Programming Languages. Ph.D. thesis, Escuela T\u00e9cnica Superior de Ingenieros Inform\u00e1ticos, UPM."},{"key":"S1471068422000059_ref28","unstructured":"Bueno, F. , Deransart, P. , Drabent, W. , Ferrand, G. , Hermenegildo, M. V. , Maluszynski, J. and Puebla, G. 1997. On the role of semantic approximations in validation and diagnosis of constraint logic programs. In Proceedings of the 3rd International. WS on Automated Debugging\u2013AADEBUG. U. Link\u00f6ping Press, 155\u2013170."},{"key":"S1471068422000059_ref307","doi-asserted-by":"crossref","unstructured":"Zhou, N.-F. and Kjellerstrand, H. 2016. The Picat-SAT compiler. In Practical Aspects of Declarative Languages - 18th International Symposium, PADL 2016, St. Petersburg, FL, USA, 18\u201319 January 2016. Proceedings, M. Gavanelli and J. H. Reppy, Eds. Lecture Notes in Computer Science, vol. 9585. Springer, Heidelberg, Germany, 48\u201362.","DOI":"10.1007\/978-3-319-28228-2_4"},{"key":"S1471068422000059_ref243","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068411000512"},{"key":"S1471068422000059_ref219","unstructured":"Pontelli, E. and Gupta, G. 1999. A simulation study of distributed execution of constraint logic programs with stack splitting. Tech. rep., New Mexico State University."},{"key":"S1471068422000059_ref213","unstructured":"Pereira, L. M. and Nasr, R. I. 1984. Delta-Prolog: A distributed logic programming language. In Proceedings of the International Conference on Fifth Generation Computer Systems, FGCS 1984, Tokyo, Japan. OHMSHA Ltd. Tokyo and North-Holland, 283\u2013291."},{"key":"S1471068422000059_ref96","unstructured":"Garcia-Contreras, I. , Morales, J. F. and Hermenegildo, M. V. 2018. Towards incremental and modular context-sensitive analysis. In Technical Communications of the 34th International Conference on Logic Programming (ICLP 2018). OpenAccess Series in Informatics (OASIcs). Dagstuhl Press. (Extended Abstract)."},{"key":"S1471068422000059_ref24","doi-asserted-by":"crossref","unstructured":"Bone, P. , Somogyi, Z. and Schachte, P. 2012. Controlling loops in parallel Mercury code. In Proceedings of the POPL 2012 Workshop on Declarative Aspects of Multicore Programming. ACM, New York, 11\u201320.","DOI":"10.1145\/2103736.2103739"},{"key":"S1471068422000059_ref120","unstructured":"Gupta, G. and Warren, D. H. D. 1992. An interpreter for the extended Andorra model (preliminary report). Technical report, University of Bristol, UK."},{"key":"S1471068422000059_ref75","author":"Dovier","year":"2016"},{"key":"S1471068422000059_ref8","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068414000179"},{"key":"S1471068422000059_ref273","doi-asserted-by":"crossref","unstructured":"Trias, E. , Navas, J. , Ackley, E. S. , Forrest, S. and Hermenegildo, M. V. 2008. Negative ternary set-sharing. In International Conference on Logic Programming, ICLP. Lecture Notes in Computer Science, vol. 5366. Springer-Verlag, Heidelberg, Germany, 301\u2013316.","DOI":"10.1007\/978-3-540-89982-2_30"},{"key":"S1471068422000059_ref145","doi-asserted-by":"publisher","DOI":"10.1109\/12.9745"},{"key":"S1471068422000059_ref147","doi-asserted-by":"crossref","unstructured":"Jordan, H. , Subotic, P. , Zhao, D. and Scholz, B. 2019. A specialized B-tree for concurrent Datalog evaluation. In Proceedings of the 24th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPoPP 2019, Washington, DC, USA, 16\u201320 February 2019, J. K. Hollingsworth and I. Keidar, Eds. ACM, New York, 327\u2013339.","DOI":"10.1145\/3293883.3295719"},{"key":"S1471068422000059_ref1","doi-asserted-by":"crossref","unstructured":"Afrati, F. N. , Borkar, V. R. , Carey, M. J. , Polyzotis, N. and Ullman, J. D. 2011. Map-Reduce extensions and recursive queries. In 14th International Conference on Extending Database Technology. ACM, New York, 1\u20138.","DOI":"10.1145\/1951365.1951367"},{"key":"S1471068422000059_ref164","doi-asserted-by":"publisher","DOI":"10.1613\/jair.4726"},{"key":"S1471068422000059_ref177","doi-asserted-by":"crossref","unstructured":"Lusk, E. , Butler, R. , Disz, T. , Olson, R. , Stevens, R. , Warren, D. H. D. , Calderwood, A. , Szeredi, P. , Brand, P. , Carlsson, M. , Ciepielewski, A. , Hausman, B. and Haridi, S. 1990. The Aurora Or-parallel Prolog system. New Generation Computing 7, 2\/3, 243\u2013271.","DOI":"10.1007\/BF03037208"},{"key":"S1471068422000059_ref109","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139342124"},{"key":"S1471068422000059_ref125","unstructured":"Haridi, S. and Janson, S. 1990. Kernel Andorra Prolog and its computation model. In Proceedings of the International Conference on Logic Programming, Warren, D. H. D. and Szeredi, P. , Eds. MIT Press, Cambridge, MA, USA, 31\u201346."},{"key":"S1471068422000059_ref302","doi-asserted-by":"publisher","DOI":"10.1016\/0167-739X(93)90016-I"},{"key":"S1471068422000059_ref198","doi-asserted-by":"publisher","DOI":"10.1016\/S0743-1066(98)10022-5"},{"key":"S1471068422000059_ref180","doi-asserted-by":"crossref","unstructured":"Malitsky, Y. , Sabharwal, A. , Samulowitz, H. and Sellmann, M. 2012. Parallel SAT solver selection and scheduling. In Principles and Practice of Constraint Programming - 18th International Conference, CP 2012, Qu\u00e9bec City, QC, Canada. Proceedings, M. Milano, Ed. Lecture Notes in Computer Science, vol. 7514. Springer, Heidelberg, Germany, 512\u2013526.","DOI":"10.1007\/978-3-642-33558-7_38"},{"key":"S1471068422000059_ref124","unstructured":"Haridi, S. and Brand, P. 1988. Andorra Prolog: An integration of Prolog and committed choice languages. In Proceedings of the International Conference on Fifth Generation Computer Systems, FGCS 1988, Tokyo, Japan, 28 November\u20132 December 1988. OHMSHA Ltd. Tokyo and Springer-Verlag, 745\u2013754."},{"key":"S1471068422000059_ref216","unstructured":"Pontelli, E. 2001. Experiments in parallel execution of answer set programs. In International Parallel and Distributed Processing Symposium. IEEE Computer Society, USA, 20."},{"key":"S1471068422000059_ref19","unstructured":"Beaumont, A. J. and Warren, D. H. D. 1993. Scheduling speculative work in Or-parallel Prolog systems. In Proceedings of the International Conference on Logic Programming, D. S. Warren, Ed. Press, MIT , Cambridge, MA , USA, 135\u2013149."},{"key":"S1471068422000059_ref167","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2009.11.016"},{"key":"S1471068422000059_ref64","doi-asserted-by":"crossref","unstructured":"De Angelis, E. , Fioravanti, F. , Pettorossi, A. and Proietti, M. 2015. Semantics-based generation of verification conditions by program specialization. In 17th International Symposium on Principles and Practice of Declarative Programming. ACM, New York, 91\u2013102.","DOI":"10.1145\/2790449.2790529"},{"key":"S1471068422000059_ref17","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511543357"},{"key":"S1471068422000059_ref262","first-page":"327","author":"S\u00f8ndergaard","year":"1986"},{"key":"S1471068422000059_ref240","unstructured":"Santos, J. and Rocha, R. 2013. Or-parallel Prolog execution on clusters of multicores. In 2nd Symposium on Languages, Applications and Technologies, Leal, J. P. , Rocha, R. and Sim\u00f5es, A. , Eds. OpenAccess Series in Informatics (OASIcs), vol. 29. Schloss Dagstuhl\u2013Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 9\u201320."},{"key":"S1471068422000059_ref69","unstructured":"de Castro Dutra, I. 1994. Strategies for scheduling and- and or-parallel work in parallel logic programming systems. In Logic Programming, Proceedings of the 1994 International Symposium, Ithaca, New York, USA, 13\u201317 November 1994, M. Bruynooghe, Ed. MIT Press, Cambridge, MA, USA, 289\u2013304."},{"key":"S1471068422000059_ref141","unstructured":"Hu, R. 1997. Efficient Tabled Evaluation of Normal Logic Programs in a Distributed Environment. Ph.D. thesis, Department of Computer Science, State University of New York."},{"key":"S1471068422000059_ref253","doi-asserted-by":"publisher","DOI":"10.1016\/j.compeleceng.2016.12.014"},{"key":"S1471068422000059_ref59","doi-asserted-by":"publisher","DOI":"10.1080\/0952813X.2014.954274"},{"key":"S1471068422000059_ref12","unstructured":"Applied Logic Systems, Inc. 2021. ALS Prolog. Tech. rep., URL: https:\/\/alsprolog.com\/."},{"key":"S1471068422000059_ref115","author":"Guo","year":"2001"},{"key":"S1471068422000059_ref20","unstructured":"Blanas, S. , Koutris, P. and Sidiropoulos, A. 2020. Topology-aware parallel data processing: Models, algorithms and systems at scale. In CIDR 2020, 10th Conference on Innovative Data Systems Research. www.cidrdb.org, 1\u20138."},{"key":"S1471068422000059_ref86","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-008-5094-2"},{"key":"S1471068422000059_ref40","unstructured":"Casas, A. 2008. Automatic Unrestricted Independent And-Parallelism in Declarative Multiparadigm Languages. Ph.D. thesis, University of New Mexico (UNM), Electrical and Computer Engineering Department, University of New Mexico, Albuquerque, NM 87131-0001 (USA)."},{"key":"S1471068422000059_ref131","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068411000457"},{"key":"S1471068422000059_ref299","first-page":"414","author":"Zaffanella","year":"1999"},{"key":"S1471068422000059_ref272","doi-asserted-by":"publisher","DOI":"10.1016\/0743-1066(94)00038-8"},{"key":"S1471068422000059_ref277","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-16479-0_17"},{"key":"S1471068422000059_ref191","doi-asserted-by":"publisher","DOI":"10.1007\/s10766-015-0364-7"},{"key":"S1471068422000059_ref174","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068418000042"},{"key":"S1471068422000059_ref58","doi-asserted-by":"crossref","unstructured":"Cousot, P. and Cousot, R. 1977. Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In Conference Records of the ACM Symposium on Principles of Programming Languages. ACM Press, New York, 238\u2013252.","DOI":"10.1145\/512950.512973"},{"key":"S1471068422000059_ref100","unstructured":"Garc\u00eda de la Banda, M. and Hermenegildo, M. V. 1993. A practical approach to the global analysis of constraint logic programs. In 1993 International Logic Programming Symposium. MIT Press, Cambridge, MA, USA, 437\u2013455."},{"key":"S1471068422000059_ref293","unstructured":"White, T. 2015. Hadoop - The Definitive Guide: Storage and Analysis at Internet Scale, 4 ed., revised & updated. O\u2019Reilly, USA."},{"key":"S1471068422000059_ref97","doi-asserted-by":"crossref","unstructured":"Garcia-Contreras, I. , Morales, J. F. and Hermenegildo, M. V. 2019. Multivariant assertion-based guidance in abstract interpretation. In Proceedings of the 28th International Symposium on Logic-based Program Synthesis and Transformation (LOPSTR\u201918). Lecture Notes in Computer Science, vol. 11408. Springer-Verlag, Heidelberg, Germany, 184\u2013201.","DOI":"10.1007\/978-3-030-13838-7_11"},{"key":"S1471068422000059_ref218","doi-asserted-by":"publisher","DOI":"10.1023\/A:1018929805694"},{"key":"S1471068422000059_ref30","doi-asserted-by":"publisher","DOI":"10.1145\/316686.316688"},{"key":"S1471068422000059_ref70","unstructured":"DeGroot, D. 1984. Restricted and-parallelism. In Proceedings of the International Conference on Fifth Generation Computer Systems, FGCS 1984, Tokyo, Japan, 6\u20139 November 1984. OHMSHA Ltd. Tokyo and North-Holland, 471\u2013478."},{"key":"S1471068422000059_ref186","doi-asserted-by":"crossref","unstructured":"Marron, M. , Kapur, D. and Hermenegildo, M. V. 2009. Identification of logically related heap regions. In ISMM\u201909: Proceedings of the 8th International Symposium on Memory management. ACM Press, New York, 89\u201398.","DOI":"10.1145\/1542431.1542445"},{"key":"S1471068422000059_ref197","doi-asserted-by":"crossref","unstructured":"Moustafa, W. E. , Papavasileiou, V. , Yocum, K. and Deutsch, A. 2016. Datalography: Scaling Datalog graph analytics on graph processing systems. In 2016 IEEE International Conference on Big Data, BigData 2016, Washington DC, USA, 5\u20138 December 2016, J. Joshi, G. Karypis, L. Liu, X. Hu, R. Ak, Y. Xia, W. Xu, A. Sato, S. Rachuri, L. H. Ungar, P. S. Yu, R. Govindaraju and T. Suzumura, Eds. IEEE Computer Society, USA, 56\u201365.","DOI":"10.1109\/BigData.2016.7840589"},{"key":"S1471068422000059_ref112","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(00)00081-3"},{"key":"S1471068422000059_ref154","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068405002528"},{"key":"S1471068422000059_ref3","doi-asserted-by":"crossref","unstructured":"Afrati, F. N. and Ullman, J. D. 2012. Transitive closure and recursive Datalog implemented on clusters. In 15th International Conference on Extending Database Technology. ACM, New York, 132\u2013143.","DOI":"10.1145\/2247596.2247613"},{"key":"S1471068422000059_ref251","volume-title":"Concurrent Prolog: Collected Papers","author":"Shapiro","year":"1987"},{"key":"S1471068422000059_ref283","doi-asserted-by":"crossref","unstructured":"Vieira, R. , Rocha, R. and Silva, F. M. A. 2012. On comparing alternative splitting strategies for Or-parallel Prolog execution on multicores. In Colloquium on Implementation of Constraint and Logic Programming Systems, 71\u201385.","DOI":"10.1145\/2103736.2103738"},{"key":"S1471068422000059_ref78","doi-asserted-by":"crossref","unstructured":"Ekanayake, J. , Li, H. , Zhang, B. , Gunarathne, T. , Bae, S.-H. , Qiu, J. and Fox, G. C. 2010. Twister: A runtime for iterative Map-Reduce. In Proceedings of the 19th ACM International Symposium on High Performance Distributed Computing. ACM Press, New York, 810\u2013818.","DOI":"10.1145\/1851476.1851593"},{"key":"S1471068422000059_ref126","unstructured":"Hausman, B. , Ciepielewski, A. and Haridi, S. 1987. Or-parallel Prolog made efficient on shared memory multiprocessors. In Symposium on Logic Programming. IEEE Computer Society, USA, 69\u201379."},{"key":"S1471068422000059_ref185","author":"Marron","year":"2008"},{"key":"S1471068422000059_ref305","doi-asserted-by":"publisher","DOI":"10.1017\/S147106840700316X"},{"key":"S1471068422000059_ref95","doi-asserted-by":"publisher","DOI":"10.1016\/0743-1066(92)90048-8"},{"key":"S1471068422000059_ref7","doi-asserted-by":"publisher","DOI":"10.1007\/BF01379406"},{"key":"S1471068422000059_ref160","doi-asserted-by":"publisher","DOI":"10.1145\/174625.174627"},{"key":"S1471068422000059_ref297","doi-asserted-by":"publisher","DOI":"10.1613\/jair.2490"},{"key":"S1471068422000059_ref214","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068411000652"},{"key":"S1471068422000059_ref176","doi-asserted-by":"publisher","DOI":"10.1142\/S0129626407002843"},{"key":"S1471068422000059_ref121","doi-asserted-by":"crossref","unstructured":"Gurfinkel, A. , Kahsai, T. , Komuravelli, A. and Navas, J. A. 2015. The SeaHorn verification framework. In International Conference on Computer Aided Verification, CAV 2015. Lecture Notes in Computer Science, vol. 9206. Springer, Heidelberg, Germany, 343\u2013361.","DOI":"10.1007\/978-3-319-21690-4_20"},{"key":"S1471068422000059_ref211","doi-asserted-by":"crossref","unstructured":"Peralta, J. C. , Gallagher, J. P. and Sa\u011elam, H. 1998. Analysis of imperative programs through analysis of constraint logic programs. In Static Analysis. 5th International Symposium, SAS\u201998, Pisa, G. Levi, Ed. Notes, Lecture in Computer Science, vol. 1503. Springer, Heidelberg, Germany, 246\u2013261.","DOI":"10.1007\/3-540-49727-7_15"},{"key":"S1471068422000059_ref264","first-page":"726","article-title":"Practical run-time checking via unobtrusive property caching","volume":"04","author":"Stulova","year":"2015","journal-title":"Theory and Practice of Logic Programming, 31st Int\u2019l. Conference on Logic Programming (ICLP\u201915) Special Issue 15"},{"key":"S1471068422000059_ref43","doi-asserted-by":"crossref","unstructured":"Casas, A. , Carro, M. and Hermenegildo, M. V. 2008b. Towards a high-level implementation of execution primitives for non-restricted, independent And-parallelism. In 10th International Symposium on Practical Aspects of Declarative Languages (PADL\u201908), D. S. Warren and P. Hudak, Eds. Lecture Notes in Computer Science, vol. 4902. Springer-Verlag, Heidelberg, Germany, 230\u2013247.","DOI":"10.1007\/978-3-540-77442-6_16"},{"key":"S1471068422000059_ref199","unstructured":"Muthukumar, K. and Hermenegildo, M. V. 1989. Determination of variable dependence information through abstract interpretation. In Logic Programming, Proceedings of the North American Conference 1989, Cleveland, Ohio, Lusk, E. L. and Overbeek, R. A. , Eds. MIT Press, Cambridge, MA, USA, 166\u2013185."},{"key":"S1471068422000059_ref168","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-83189-8"},{"key":"S1471068422000059_ref173","first-page":"117","article-title":"Automatic inference of determinacy and mutual exclusion for logic programs using mode and type information","volume":"2","author":"Lopez-Garcia","year":"2010","journal-title":"New Generation Computing 28"},{"key":"S1471068422000059_ref135","volume-title":"The Logic Programming Paradigm: A 25\u2013Year Perspective","author":"Hermenegildo","year":"1999"},{"key":"S1471068422000059_ref298","unstructured":"Yang, M. , Shkapsky, A. and Zaniolo, C. 2015. Parallel bottom-up evaluation of logic programs: DeALS on shared-memory multicore machines. In Proceedings of the Technical Communications of the 31st International Conference on Logic Programming (ICLP) 2015, Cork, Ireland, M. D. Vos, T. Eiter, Y. Lierler and F. Toni, Eds. CEUR Workshop Proceedings, vol. 1433. CEUR-WS.org, Aachen."},{"key":"S1471068422000059_ref244","doi-asserted-by":"crossref","unstructured":"Santos Costa, V. , Warren, D. H. D. and Yang, R. 1991a. Andorra-I: A parallel Prolog system that transparently exploits both And- and Or-parallelism. In Proceedings of the ACM Symposium on Principles and Practice of Parallel Programming. ACM Press, New York, 83\u201393.","DOI":"10.1145\/109626.109635"},{"key":"S1471068422000059_ref83","unstructured":"Finkel, R. , Marek, V. , Moore, N. and Truszczy\u0144ski, M. 2001. Computing stable models in parallel. In Proceedings of the AAAI Spring Symposium on Answer Set Programming, Provetti, A. and Tran, S. C. , Eds. AAAI\/MIT Press, Cambridge, MA, USA, 72\u201375."},{"key":"S1471068422000059_ref47","author":"Chico de Guzm\u00e1n","year":"2012"},{"key":"S1471068422000059_ref245","unstructured":"Santos Costa, V. , Warren, D. H. D. and Yang, R. 1991b. The Andorra-I engine: A parallel implementation of the basic Andorra model. In Proceedings of the International Conference on Logic Programming, K. Furukawa, Ed. Press, MIT , Cambridge, MA , USA, 825\u2013839."},{"key":"S1471068422000059_ref18","unstructured":"Barklund, J. 1990. Parallel Unification. Ph.D. thesis, Uppsala University. Uppsala Theses in Computing Science 9."},{"key":"S1471068422000059_ref294","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068411000494"},{"key":"S1471068422000059_ref220","doi-asserted-by":"publisher","DOI":"10.1109\/71.969127"},{"key":"S1471068422000059_ref271","first-page":"79","article-title":"Completeness, decidability and complexity of entailment for RDF schema and a semantic extension involving the OWL vocabulary","volume":"2","year":"2005","journal-title":"Journal of Web Semantics 3"},{"key":"S1471068422000059_ref183","author":"Marques","year":"2010"},{"key":"S1471068422000059_ref201","unstructured":"Muthukumar, K. and Hermenegildo, M. V. 1991. Combined determination of sharing and freeness of program variables through abstract interpretation. In Logic Programming, Proceedings of the Eigth International Conference, Paris, France, K. Furukawa, Ed. Press, MIT , Cambridge, MA , USA, 49\u201363."},{"key":"S1471068422000059_ref241","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068416000296"},{"key":"S1471068422000059_ref210","unstructured":"NVIDIA Corporation. 2021. NVIDIA CUDA Zone. URL: https:\/\/developer.nvidia.com\/cuda-zone."},{"key":"S1471068422000059_ref144","unstructured":"Jacobs, D. and Langen, A. 1989. Accurate and efficient approximation of variable aliasing in logic programs. In 1989 North American Conference on Logic Programming. MIT Press, Cambridge, MA, USA."},{"key":"S1471068422000059_ref101","doi-asserted-by":"publisher","DOI":"10.1145\/232706.232734"},{"key":"S1471068422000059_ref187","author":"Marron","year":"2006"},{"key":"S1471068422000059_ref275","first-page":"121","author":"Truszczynski","year":"2018"},{"key":"S1471068422000059_ref196","doi-asserted-by":"crossref","unstructured":"Mera, E. , Lopez-Garcia, P. , Carro, M. and Hermenegildo, M. V. 2008. Towards execution time estimation in abstract machine-based languages. In 10th International ACM SIGPLAN Symposium on Principles and Practice of Declarative Programming (PPDP\u201908). ACM Press, New York, 174\u2013184.","DOI":"10.1145\/1389449.1389471"},{"key":"S1471068422000059_ref171","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068411000068"},{"key":"S1471068422000059_ref286","doi-asserted-by":"crossref","unstructured":"Villaverde, K. , Pontelli, E. , Guo, H.-F. and Gupta, G. 2001b. PALS: An Or-parallel implementation of Prolog on Bewoulf architectures. In Proceedings of the International Conference on Logic Programming. Springer Verlag, Heidelberg, Germany, 27\u201342.","DOI":"10.1007\/3-540-45635-X_10"},{"key":"S1471068422000059_ref53","doi-asserted-by":"publisher","DOI":"10.1007\/BF03037415"},{"key":"S1471068422000059_ref113","first-page":"1409","article-title":"Decompilation of Java bytecode to Prolog by partial evaluation","author":"G\u00d3mez-Zamalloa","year":"2009","journal-title":"JIST 51"},{"key":"S1471068422000059_ref31","doi-asserted-by":"crossref","unstructured":"Bueno, F. , Lopez-Garcia, P. and Hermenegildo, M. V. 2004. Multivariant non-failure analysis via standard abstract interpretation. In 7th International Symposium on Functional and Logic Programming (FLOPS 2004). Lecture Notes in Computer Science, vol. 2998. Springer-Verlag, Heidelberg, Germany, 100\u2013116.","DOI":"10.1007\/978-3-540-24754-8_9"},{"key":"S1471068422000059_ref38","unstructured":"Carro, M. 2001. Some Contributions to the Study of Parallelism and Concurrency in Logic Programming. Ph.D. thesis, Universidad Polit\u00e9cnica de Madrid (UPM), Facultad Informatica UPM, 28660-Boadilla del Monte, Madrid-Spain."},{"key":"S1471068422000059_ref224","doi-asserted-by":"publisher","DOI":"10.1016\/j.cl.2009.09.001"},{"key":"S1471068422000059_ref46","first-page":"555","article-title":"Parallel backtracking with answer memoing for independent And-parallelism","volume":"4\u20135","author":"Chico de Guzm\u00e1n","year":"2011","journal-title":"Theory and Practice of Logic Programming, 27th Int\u2019l. Conference on Logic Programming (ICLP\u201911) Special Issue 11"},{"key":"S1471068422000059_ref238","doi-asserted-by":"crossref","unstructured":"Saeed, I. , Young, J. and Yalamanchili, S. 2015. A portable benchmark suite for highly parallel data intensive query processing. In Proceedings of the 2nd Workshop on Parallel Programming for Analytics Applications. ACM, New York, 31\u201338.","DOI":"10.1145\/2726935.2726943"},{"key":"S1471068422000059_ref85","author":"Fonseca","year":"2006"},{"key":"S1471068422000059_ref36","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2008.02.003"},{"key":"S1471068422000059_ref239","doi-asserted-by":"publisher","DOI":"10.1145\/291889.291897"},{"key":"S1471068422000059_ref295","doi-asserted-by":"crossref","unstructured":"Wolfson, O. and Silberschatz, A. 1988. Distributed processing of logic programs. In Proceedings of the SIGMOD International Conference on Management of Data, H. Boral and P. Larson, Eds. ACM Press, New York, 329\u2013336.","DOI":"10.1145\/971701.50242"},{"key":"S1471068422000059_ref107","doi-asserted-by":"crossref","unstructured":"Gebser, M. , Leone, N. , Maratea, M. , Perri, S. , Ricca, F. and Schaub, T. 2018. Evaluation techniques and systems for answer set programming: A survey. In Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, IJCAI 2018, 13\u201319 July 2018, Stockholm, Sweden, J. Lang, Ed. ijcai.org, 5450\u20135456.","DOI":"10.24963\/ijcai.2018\/769"},{"key":"S1471068422000059_ref230","doi-asserted-by":"publisher","DOI":"10.1007\/BF03037223"},{"key":"S1471068422000059_ref155","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068422000102"},{"key":"S1471068422000059_ref138","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068401001338"},{"key":"S1471068422000059_ref266","doi-asserted-by":"crossref","unstructured":"Swift, T. and Warren, D. S. 2012. XSB: Extending Prolog with tabled logic programming. Theory and Practice of Logic Programming 12, 1 & 2, 157\u2013187.","DOI":"10.1017\/S1471068411000500"},{"key":"S1471068422000059_ref304","article-title":"Debugging large-scale Datalog: A scalable provenance evaluation strategy","volume":"2","author":"Zhao","year":"2020","journal-title":"ACM Transactions on Programming Languages and Systems 42"},{"key":"S1471068422000059_ref217","doi-asserted-by":"crossref","unstructured":"Pontelli, E. and Gupta, G. 1995. On the duality between And-parallelism and Or-parallelism. In Proceedings of EuroPar, Haridi, S. and Magnusson, P. , Eds. Springer Verlag, Heidelberg, Germany, 43\u201354.","DOI":"10.1007\/BFb0020454"},{"key":"S1471068422000059_ref60","doi-asserted-by":"publisher","DOI":"10.3233\/FI-2009-180"},{"key":"S1471068422000059_ref14","doi-asserted-by":"crossref","unstructured":"Areias, M. and Rocha, R. 2015. Batched evaluation of full-sharing multithreaded tabling. In Post-Proceedings of the 4th Symposium on Languages, Applications and Technologies. CCIS, vol. 563. Springer, Heidelberg, Germany, 113\u2013124.","DOI":"10.1007\/978-3-319-27653-3_11"},{"key":"S1471068422000059_ref300","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068417000436"},{"key":"S1471068422000059_ref159","unstructured":"Le, H. and Pontelli, E. 2007. Dynamic scheduling in parallel answer set programming solvers. In Proceedings of the 2007 Spring Simulation Multiconference, SpringSim 2007. ACM Press, New York, 367\u2013374."},{"key":"S1471068422000059_ref175","first-page":"715","article-title":"A methodology for granularity based control of parallelism in logic programs","volume":"4\u20136","author":"Lopez-Garcia","year":"1996","journal-title":"Journal of Symbolic Computation, Special Issue on Parallel Symbolic Computation 21"},{"key":"S1471068422000059_ref63","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068421000211"},{"key":"S1471068422000059_ref103","unstructured":"Garc\u00eda de la Banda, M. , Marriott, K. and Stuckey, P. J. 1995. Efficient analysis of constraint logic programs with dynamic scheduling. In 1995 International Logic Programming Symposium. MIT Press, Cambridge, MA, USA, 417\u2013431."},{"key":"S1471068422000059_ref13","doi-asserted-by":"crossref","unstructured":"Areias, M. and Rocha, R. 2012. Towards multi-threaded local tabling using a common table space. Theory and Practice of Logic Programming, International Conference on Logic Programming, Special Issue 12, 4 & 5, 427\u2013443.","DOI":"10.1017\/S1471068412000117"},{"key":"S1471068422000059_ref225","unstructured":"Pontelli, E. , Le, T. , Nguyen, H. and Son, T. C. 2012. ASP at work: An ASP implementation of PhyloWS. In Technical Communications of the 28th International Conference on Logic Programming, ICLP 2012, Budapest, Hungary, Dovier, A. and Santos Costa, V. , Eds. LIPICS, vol. 17. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 359\u2013369."},{"key":"S1471068422000059_ref157","doi-asserted-by":"crossref","unstructured":"Lagoon, V. and Stuckey, P. J. 2002. Precise pair-sharing analysis of logic programs. In Principles and Practice of Declarative Programming. ACM Press, New York, 99\u2013108.","DOI":"10.1145\/571157.571168"},{"key":"S1471068422000059_ref61","author":"Dam\u00e1sio","year":"2000"},{"key":"S1471068422000059_ref296","doi-asserted-by":"crossref","unstructured":"Wu, H. , Diamos, G. F. , Sheard, T. , Aref, M. , Baxter, S. , Garland, M. and Yalamanchili, S. 2014. Red Fox: An execution environment for relational query processing on GPUs. In 12th Annual IEEE\/ACM International Symposium on Code Generation and Optimization, CGO 2014, Orlando, FL, USA, 15\u201319 February 2014, D. R. Kaeli and T. Moseley, Eds. ACM, New York, 44.","DOI":"10.1145\/2544137.2544166"},{"key":"S1471068422000059_ref148","doi-asserted-by":"crossref","unstructured":"Kahsai, T. , R\u00fcmmer, P. , Sanchez, H. and Sch\u00e4f, M. 2016. JayHorn: A framework for verifying Java programs. In Computer Aided Verification - 28th International Conference, CAV 2016, Chaudhuri, S. and Farzan, A. , Eds. Lecture Notes in Computer Science, vol. 9779. Springer, Heidelberg, Germany, 352\u2013358.","DOI":"10.1007\/978-3-319-41528-4_19"},{"key":"S1471068422000059_ref134","doi-asserted-by":"crossref","unstructured":"Hermenegildo, M. V. and Nasr, R. I. 1986. Efficient management of backtracking in And-parallelism. In Third International Conference on Logic Programming, E. Y. Shapiro, Ed. Notes, Lecture in Computer Science, vol. 225. Springer-Verlag, Heidelberg, Germany, 40\u201354.","DOI":"10.1007\/3-540-16492-8_63"},{"key":"S1471068422000059_ref90","author":"Freire","year":"1995"},{"key":"S1471068422000059_ref142","doi-asserted-by":"crossref","unstructured":"Huang, Y. and Chen, W. 2015. Parallel query on the in-memory database in a CUDA platform. In 10th International Conference on P2P, Parallel, Grid, Cloud and Internet Computing, 3PGCIC 2015, Krakow, Poland, 4\u20136 November 2015, F. Xhafa, L. Barolli, F. Messina and M. R. Ogiela, Eds. IEEE Computer Society, USA, 236\u2013243.","DOI":"10.1109\/3PGCIC.2015.34"},{"key":"S1471068422000059_ref200","unstructured":"Muthukumar, K. and Hermenegildo, M. V. 1990. Deriving a fixpoint computation algorithm for top-down abstract interpretation of logic programs. Technical Report ACT-DC-153-90, Microelectronics and Computer Technology Corporation (MCC), Austin, TX 78759."},{"key":"S1471068422000059_ref248","doi-asserted-by":"crossref","unstructured":"Secci, S. and Spoto, F. 2005. Pair-sharing analysis of object-oriented programs. In 12th International Symposium Static Analysis Symposium (SAS\u201905). Lecture Notes in Computer Science, vol. 3672. Springer, Heidelberg, Germany, 320\u2013335.","DOI":"10.1007\/11547662_22"},{"key":"S1471068422000059_ref257","doi-asserted-by":"crossref","unstructured":"Shkapsky, A. , Yang, M. , Interlandi, M. , Chiu, H. , Condie, T. and Zaniolo, C. 2016. Big data analytics with Datalog queries on Spark. In Proceedings of the 2016 International Conference on Management of Data, SIGMOD Conference 2016, San Francisco, CA, USA, 26 June\u201301 July 2016, F. \u00d6zcan, G. Koutrika and S. Madden, Eds. ACM, New York, 1135\u20131149.","DOI":"10.1145\/2882903.2915229"},{"key":"S1471068422000059_ref146","doi-asserted-by":"crossref","unstructured":"Jordan, H. , Scholz, B. and Subotic, P. 2016. Souffl\u00e9: On synthesis of program analyzers. In Computer Aided Verification - 28th International Conference, CAV 2016, Toronto, ON, Canada, 17\u201323 July 2016, Proceedings, Part II, S. Chaudhuri and A. Farzan, Eds. Lecture Notes in Computer Science, vol. 9780. Springer, Heidelberg, Germany, 422\u2013430.","DOI":"10.1007\/978-3-319-41540-6_23"},{"key":"S1471068422000059_ref132","unstructured":"Hermenegildo, M. V. , Bueno, F. , Garc\u00eda de la Banda, M. and Puebla, G. 1995. The CIAO multi-dialect compiler and system: An experimentation workbench for future (C)LP systems. In Proceedings of the ILPS\u201995 Workshop on Visions for the Future of Logic Programming. Portland, Oregon, USA. URL: http:\/\/www.cliplab.org\/http:\/\/www.cliplab.org\/."},{"key":"S1471068422000059_ref192","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/0020-0190(89)90212-3","article-title":"Global quiescence detection based on credit distribution and recovery","volume":"4","author":"Mattern","year":"1989","journal-title":"Information Processing Letters 30"},{"key":"S1471068422000059_ref250","doi-asserted-by":"publisher","DOI":"10.1017\/S147106841400057X"},{"key":"S1471068422000059_ref194","volume-title":"Computer Science","volume":"5335","author":"M\u00e9ndez-Lojo","year":"2008"},{"key":"S1471068422000059_ref110","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068418000340"},{"key":"S1471068422000059_ref74","unstructured":"Dovier, A. , Formisano, A. , Pontelli, E. and Vella, F. 2015. Parallel execution of the ASP computation. In Technical Communications of ICLP 2015, M. De Vos, T. Eiter, Y. Lierler and F. Toni, Eds., vol. 1433. CEUR-WS.org, Aachen."},{"key":"S1471068422000059_ref221","unstructured":"Pontelli, E. , Gupta, G. and Hermenegildo, M. V. 1995. &ACE: A high-performance parallel Prolog system. In Proceedings of the International Parallel Processing Symposium. IEEE Computer Society, USA, 564\u2013571."},{"key":"S1471068422000059_ref222","unstructured":"Pontelli, E. , Gupta, G. , Pulvirenti, F. and Ferro, A. 1997. Automatic compile-time parallelization of Prolog programs for dependent And-parallelism. In Proceedings of the Fourteenth International Conference on Logic Programming, L. Naish, Ed. Press, MIT , Cambridge, MA , USA, 108\u2013122."},{"key":"S1471068422000059_ref52","first-page":"1","article-title":"Parlog: Parallel programming in logic","volume":"1","author":"Clark","year":"1986","journal-title":"Transactions on Programming Languages and Systems 8"},{"key":"S1471068422000059_ref81","doi-asserted-by":"crossref","unstructured":"Fan, Z. , Zhu, J. , Zhang, Z. , Albarghouthi, A. , Koutris, P. and Patel, J. M. 2019. Scaling-up in-memory Datalog processing: Observations and techniques. Proceedings of the VLDB Endowment 12, 6, 695\u2013708.","DOI":"10.14778\/3311880.3311886"},{"key":"S1471068422000059_ref242","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068410000190"},{"key":"S1471068422000059_ref234","unstructured":"Rocha, R. , Silva, F. M. A. and Santos Costa, V. 2000. A tabling engine for the Yap Prolog system. In APPIA-GULP-PRODE Joint Conference on Declarative Programming, La Habana, Cuba, 4\u20136 December. Cuba."},{"key":"S1471068422000059_ref232","author":"Rocha","year":"1999"},{"key":"S1471068422000059_ref226","first-page":"181","article-title":"An optimal data structure to handle dynamic environments in non-deterministic computations","volume":"2","author":"Pontelli","year":"2002","journal-title":"Computer Languages 28"},{"key":"S1471068422000059_ref309","doi-asserted-by":"crossref","unstructured":"Zinn, D. , Wu, H. , Wang, J. , Aref, M. and Yalamanchili, S. 2016. General-purpose join algorithms for large graph triangle listing on heterogeneous systems. In Proceedings of the 9th Annual Workshop on General Purpose Processing using Graphics Processing Unit, GPGPU@PPoPP 2016, Barcelona, Spain, 12\u201316 March 2016, D. R. Kaeli and J. Cavazos, Eds. ACM, New York, 12\u201321.","DOI":"10.1145\/2884045.2884054"},{"key":"S1471068422000059_ref281","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1016\/0743-1066(94)90031-0","article-title":"1983\u20131993: The wonder years of sequential Prolog implementation","author":"Van Roy","year":"1994","journal-title":"Journal of Logic Programming 19\/20"},{"key":"S1471068422000059_ref77","doi-asserted-by":"publisher","DOI":"10.1007\/s13218-018-0535-y"},{"key":"S1471068422000059_ref127","doi-asserted-by":"crossref","unstructured":"Henriksen, K. S. and Gallagher, J. P. 2006. Abstract interpretation of PIC programs through logic programming. In SCAM\u201906. IEEE Computer Society, USA, 184\u2013196.","DOI":"10.1109\/SCAM.2006.1"},{"key":"S1471068422000059_ref289","doi-asserted-by":"crossref","unstructured":"Wang, J. , Balazinska, M. and Halperin, D. 2015. Asynchronous and fault-tolerant recursive Datalog evaluation in shared-nothing engines. Proceedings of the VLDB Endowment 8, 12, 1542\u20131553.","DOI":"10.14778\/2824032.2824052"},{"key":"S1471068422000059_ref285","doi-asserted-by":"crossref","unstructured":"Villaverde, K. , Pontelli, E. , Guo, H.-F. and Gupta, G. 2001a. Incremental stack splitting mechanisms for efficient parallel implementation of search-based systems. In International Conference on Parallel Processing. IEEE Computer Society, USA, 287\u2013294.","DOI":"10.1109\/ICPP.2001.952073"}],"container-title":["Theory and Practice of Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S1471068422000059","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,6]],"date-time":"2022-10-06T12:57:43Z","timestamp":1665061063000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1471068422000059\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3,28]]},"references-count":309,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2022,11]]}},"alternative-id":["S1471068422000059"],"URL":"https:\/\/doi.org\/10.1017\/s1471068422000059","relation":{},"ISSN":["1471-0684","1475-3081"],"issn-type":[{"value":"1471-0684","type":"print"},{"value":"1475-3081","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,3,28]]},"assertion":[{"value":"\u00a9 The Author(s), 2022. Published by Cambridge University Press","name":"copyright","label":"Copyright","group":{"name":"copyright_and_licensing","label":"Copyright and Licensing"}}]}}