Parallel Logic Programming: A Sequel
From MaRDI portal
Publication:6063892
DOI10.1017/s1471068422000059arXiv2111.11218OpenAlexW3216741911MaRDI QIDQ6063892
Manuel V. Hermenegildo, Enrico Pontelli, Unnamed Author, Ricardo Rocha, Andrea Formisano, Agostino Dovier
Publication date: 12 December 2023
Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2111.11218
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Cost analysis of object-oriented bytecode programs
- Logic programs with abstract constraint atoms: the role of computations
- Automatic inference of determinacy and mutual exclusion for logic programs using mode and type analyses
- Parallel ILP for distributed-memory architectures
- Non-strict independence-based program parallelization using sharing and freeness information
- Scheduling speculative work in MUSE and performance results
- Parallel symbolic computation in ACE
- Parallelizing irregular and pointer-based computations automatically: Perspectives from logic and constraint programming
- Extending and implementing the stable model semantics
- Conflict-driven answer set solving: from theory to practice
- An optimal data structure to handle dynamic environments in non-deterministic computations
- A methodology for granularity-based control of parallelism in logic programs
- Stack splitting: a technique for efficient exploitation of search parallelism on share-nothing platforms
- Integrated program debugging, verification, and optimization using abstract interpretation (and the Ciao system preprocessor)
- BerkMin: A fast and robust SAT-solver
- The YAP Prolog system
- SICStus Prolog—The first 25 years
- SWI-Prolog
- XSB: Extending Prolog with Tabled Logic Programming
- The language features and architecture of B-Prolog
- An overview of Ciao and its design philosophy
- A design and implementation of the Extended Andorra Model
- Efficient Computation of the Well-Founded Semantics over Big Data
- SUNNY: a Lazy Portfolio Approach for Constraint Solving
- claspfolio2: Advances in Algorithm Selection for Answer Set Programming
- Resource Usage Analysis of Logic Programs via Abstract Interpretation Using Sized Types
- Parallel backtracking with answer memoing for independent and-parallelism
- GASP: Answer Set Programming with Lazy Grounding
- Graphs and colorings for answer set programming
- Lazy Set-Sharing Analysis
- Experimenting with parallelism for the instantiation of ASP programs
- Threads and or-parallelism unified
- MULTILISP: a language for concurrent symbolic computation
- PARLOG: parallel programming in logic
- A randomized parallel backtracking algorithm
- Compile-time derivation of variable dependency using abstract interpretation
- Parallel bottom-up processing of datalog queries
- Automatic compile-time parallelization of logic programs for restricted, goal level, independent and parallelism
- The well-founded semantics for general logic programs
- 1983–1993: The wonder years of sequential Prolog implementation
- Strict and nonstrict independent and-parallelism in logic programs: Correctness, efficiency, and compile-time conditions
- Overview of DASWAM: Exploitation of dependent and-parallelism
- Tabled evaluation with delaying for general logic programs
- Knowledge Representation, Reasoning and Declarative Problem Solving
- Soundness, idempotence and commutativity of set-sharing
- Transformation-based bottom-up computation of the well-founded model
- A review of literature on parallel constraint solving
- Scaling-up reasoning and advanced analytics on BigData
- Logic programming as a service
- Fixpoint semantics and optimization of recursive Datalog programs with aggregates
- aspeed: Solver scheduling via answer set programming
- Tabling as a library with delimited control
- Practical run-time checking via unobtrusive property caching
- On the Implementation of an Or-Parallel Prolog System for Clusters of Multicores
- Interval-based resource usage verification by translation into Horn clauses and an application to energy consumption
- On applying or-parallelism and tabling to logic programs
- Towards multi-threaded local tabling using a common table space
- Annotation of logic programs for independent AND-parallelism by partial evaluation
- Abstract multiple specialization and its application to program parallelization
- An algebraic approach to sharing analysis of logic programs
- The Seventh Answer Set Programming Competition: Design and Results
- Incremental and Modular Context-sensitive Analysis
- Guarded horn clauses
- A General Framework for Static Cost Analysis of Parallel Logic Programs
- Incremental Analysis of Logic Programs with Assertions and Open Predicates
- A Case for Stale Synchronous Distributed Model for Declarative Recursive Computation
- Parallel instantiation of ASP programs: techniques and experiments
- Functional and Logic Programming
- Functional and Logic Programming
- ASP at Work: An ASP Implementation of PhyloWS
- PALS: Efficient Or-Parallel execution of Prolog on Beowulf clusters
- Linear tabling strategies and optimizations
- Precise Set Sharing Analysis for Java-Style Programs
- Annotation Algorithms for Unrestricted Independent And-Parallelism in Logic Programs
- A Flexible, (C)LP-Based Approach to the Analysis of Object-Oriented Programs
- Concurrent and Local Evaluation of Normal Programs
- Negative Ternary Set-Sharing
- A High-Level Implementation of Non-deterministic, Unrestricted, Independent And-Parallelism
- The deevolution of concurrent logic programming languages
- Static Analysis
- Algorithm portfolios
- Multivariant assertion-based guidance in abstract interpretation
This page was built for publication: Parallel Logic Programming: A Sequel
