Parallel Logic Programming: A Sequel
Not on the map. Why?
Abstract (arXiv)
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. 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. Under consideration in Theory and Practice of Logic Programming (TPLP).
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 18 of its 306 references that are in the map. First posted on arXiv 22 Nov 2021.
Builds on
18 of 306 references.
References · 18
- 2019The Seventh Answer Set Programming Competition: Design and Resultscited by 11
- 2014claspfolio 2: Advances in Algorithm Selection for Answer Set Programmingcited by 8
- 2014Solver Scheduling via Answer Set Programmingcited by 7
- 2013A Multi-Engine Approach to Answer Set Programmingcited by 6
- 2017Fixpoint Semantics and Optimization of Recursive Datalog Programs with Aggregatescited by 4
- 2018Interval-based Resource Usage Verification by Translation into Horn Clauses and an Application to Energy Consumptioncited by 3
- 2018A Review of Literature on Parallel Constraint Solvingcited by 3
- 2018Scaling-Up In-Memory Datalog Processing: Observations and Techniquescited by 3
- 2019GPU-based parallelism for ASP-solvingcited by 3
- 2017Accelerating Energy Games Solvers on Modern Architecturescited by 2
- 2018Logic Programming as a Servicecited by 2
- 2018Scaling-Up Reasoning and Advanced Analytics on BigDatacited by 2
6 more
- 2019A Case for Stale Synchronous Distributed Model for Declarative Recursive Computationcited by 2
- 2021Analysis and Transformation of Constrained Horn Clauses for Program Verificationcited by 2
- 2013On Comparing Alternative Splitting Strategies for Or-Parallel Prolog Execution on Multicorescited by 1
- 2015Inferring Parametric Energy Consumption Functions at Different Software Levels: ISA vs. LLVM IRcited by 1
- 2018Multivariant Assertion-based Guidance in Abstract Interpretationcited by 1
- 2020From Big-Step to Small-Step Semantics and Back with Interpreter Specialisationcited by 1
Built on by
Citing papers per year: 2024: 1; 2025: 0; 2026: 2.
3 papers.