Parallel Logic Programming: A Sequel
From MaRDI portal
Abstract: 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).
Recommendations
Cites work
- 1983–1993: The wonder years of sequential Prolog implementation
- claspfolio2: Advances in Algorithm Selection for Answer Set Programming
- A Case for Stale Synchronous Distributed Model for Declarative Recursive Computation
- A design and implementation of the extended Andorra model
- A Flexible, (C)LP-Based Approach to the Analysis of Object-Oriented Programs
- A general framework for static cost analysis of parallel logic programs
- A High-Level Implementation of Non-deterministic, Unrestricted, Independent And-Parallelism
- A methodology for granularity-based control of parallelism in logic programs
- A randomized parallel backtracking algorithm
- A review of literature on parallel constraint solving
- Abstract multiple specialization and its application to program parallelization
- Algorithm portfolios
- An algebraic approach to sharing analysis of logic programs
- An optimal data structure to handle dynamic environments in non-deterministic computations
- An overview of Ciao and its design philosophy
- Annotation Algorithms for Unrestricted Independent And-Parallelism in Logic Programs
- Annotation of logic programs for independent AND-parallelism by partial evaluation
- ASP at work: an ASP implementation of PhyloWS
- aspeed: solver scheduling via answer set programming
- Automatic compile-time parallelization of logic programs for restricted, goal level, independent and parallelism
- Automatic inference of determinacy and mutual exclusion for logic programs using mode and type analyses
- BerkMin: A fast and robust SAT-solver
- Compile-time derivation of variable dependency using abstract interpretation
- Concurrent and Local Evaluation of Normal Programs
- Conflict-driven answer set solving: from theory to practice
- Cost analysis of object-oriented bytecode programs
- Efficient computation of the well-founded semantics over big data
- Experimenting with parallelism for the instantiation of ASP programs
- Extending and implementing the stable model semantics
- Fixpoint semantics and optimization of recursive Datalog programs with aggregates
- Functional and Logic Programming
- Functional and Logic Programming
- GASP: Answer set programming with lazy grounding
- Graphs and colorings for answer set programming
- Guarded horn clauses
- scientific article; zbMATH DE number 5914356 (Why is no real title available?)
- scientific article; zbMATH DE number 3958714 (Why is no real title available?)
- scientific article; zbMATH DE number 3965422 (Why is no real title available?)
- scientific article; zbMATH DE number 3965423 (Why is no real title available?)
- scientific article; zbMATH DE number 3978439 (Why is no real title available?)
- scientific article; zbMATH DE number 3664336 (Why is no real title available?)
- scientific article; zbMATH DE number 43398 (Why is no real title available?)
- scientific article; zbMATH DE number 1254022 (Why is no real title available?)
- scientific article; zbMATH DE number 1332641 (Why is no real title available?)
- scientific article; zbMATH DE number 1487849 (Why is no real title available?)
- scientific article; zbMATH DE number 1368925 (Why is no real title available?)
- scientific article; zbMATH DE number 2085267 (Why is no real title available?)
- scientific article; zbMATH DE number 2085268 (Why is no real title available?)
- scientific article; zbMATH DE number 2085277 (Why is no real title available?)
- scientific article; zbMATH DE number 7453190 (Why is no real title available?)
- Incremental analysis of logic programs with assertions and open predicates
- Incremental and modular context-sensitive analysis
- Integrated program debugging, verification, and optimization using abstract interpretation (and the Ciao system preprocessor)
- Interval-based resource usage verification by translation into Horn clauses and an application to energy consumption
- Knowledge Representation, Reasoning and Declarative Problem Solving
- Large-scale parallel stratified defeasible reasoning
- Lazy Set-Sharing Analysis
- Linear tabling strategies and optimizations
- Logic programming as a service
- Logic programs with abstract constraint atoms: the role of computations
- MULTILISP: a language for concurrent symbolic computation
- Multivariant assertion-based guidance in abstract interpretation
- Negative Ternary Set-Sharing
- Non-strict independence-based program parallelization using sharing and freeness information
- On applying or-parallelism and tabling to logic programs
- On the implementation of an or-parallel Prolog system for clusters of multicores
- Overview of DASWAM: Exploitation of dependent and-parallelism
- PALS: Efficient Or-Parallel execution of Prolog on Beowulf clusters
- Parallel backtracking with answer memoing for independent and-parallelism
- Parallel bottom-up evaluation of logic programs: \(\mathcal{D}e\mathcal{ALS}\) on shared-memory multicore machines
- Parallel bottom-up processing of datalog queries
- Parallel ILP for distributed-memory architectures
- Parallel instantiation of ASP programs: techniques and experiments
- Parallel symbolic computation in ACE
- Parallelizing irregular and pointer-based computations automatically: Perspectives from logic and constraint programming
- PARLOG: parallel programming in logic
- Practical run-time checking via unobtrusive property caching
- Precise Set Sharing Analysis for Java-Style Programs
- Resource usage analysis of logic programs via abstract interpretation using sized types
- SATzilla: portfolio-based algorithm selection for SAT
- Scaling-up reasoning and advanced analytics on BigData
- Scheduling speculative work in MUSE and performance results
- SICStus Prolog -- the first 25 years
- Soundness, idempotence and commutativity of set-sharing
- Stack splitting: a technique for efficient exploitation of search parallelism on share-nothing platforms
- Static Analysis
- Strict and nonstrict independent and-parallelism in logic programs: Correctness, efficiency, and compile-time conditions
- SUNNY: a lazy portfolio approach for constraint solving
- SWI-Prolog
- Tabled evaluation with delaying for general logic programs
- Tabling as a library with delimited control
- The deevolution of concurrent logic programming languages
- The language features and architecture of B-Prolog
- The Seventh Answer Set Programming Competition: Design and Results
- The well-founded semantics for general logic programs
- The YAP prolog system
- Threads and or-parallelism unified
- Towards multi-threaded local tabling using a common table space
- Transformation-based bottom-up computation of the well-founded model
- XSB: extending Prolog with tabled logic programming
Cited in
(13)- P-Prolog: A parallel logic language based on exclusive relation
- Exploiting parallelism in coalgebraic logic programming
- scientific article; zbMATH DE number 4049157 (Why is no real title available?)
- scientific article; zbMATH DE number 4058820 (Why is no real title available?)
- scientific article; zbMATH DE number 67822 (Why is no real title available?)
- scientific article; zbMATH DE number 107874 (Why is no real title available?)
- scientific article; zbMATH DE number 1333354 (Why is no real title available?)
- scientific article; zbMATH DE number 516999 (Why is no real title available?)
- Parallel execution of logic programs by load sharing
- Past and present (and future) of parallel and distributed computation in (constraint) logic programming
- scientific article; zbMATH DE number 1862076 (Why is no real title available?)
- scientific article; zbMATH DE number 7561474 (Why is no real title available?)
- Massive unification
This page was built for publication: Parallel Logic Programming: A Sequel
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6063892)
