Parallel Logic Programming: A Sequel (Q6063892): Difference between revisions

From MaRDI portal

Jump to:navigation, search

Latest revision as of 18:06, 30 December 2024

scientific article; zbMATH DE number 7776352

Language	Label	Description	Also known as
English	Parallel Logic Programming: A Sequel	scientific article; zbMATH DE number 7776352

Statements

scholarly article

0 references

Parallel Logic Programming: A Sequel (English)

0 references

Agostino Dovier

0 references

Andrea Formisano

0 references

0 references

Manuel V. Hermenegildo

0 references

Enrico Pontelli

0 references

0 references

Theory and Practice of Logic Programming

0 references

publication date

12 December 2023

0 references

full work available at URL

https://arxiv.org/abs/2111.11218

0 references

zbMATH Keywords

parallelism

0 references

high-performance computing

0 references

logic programming

0 references

MaRDI profile type

0 references

Cost analysis of object-oriented bytecode programs

0 references

Scheduling speculative work in MUSE and performance results

0 references

SUNNY: a Lazy Portfolio Approach for Constraint Solving

0 references

Towards multi-threaded local tabling using a common table space

0 references

Knowledge Representation, Reasoning and Declarative Problem Solving

0 references

Transformation-based bottom-up computation of the well-founded model

0 references

Functional and Logic Programming

0 references

Functional and Logic Programming

0 references

Non-strict independence-based program parallelization using sharing and freeness information

0 references

Logic programming as a service

0 references

Experimenting with parallelism for the instantiation of ASP programs

0 references

SICStus Prolog—The first 25 years

0 references

Annotation Algorithms for Unrestricted Independent And-Parallelism in Logic Programs

0 references

A High-Level Implementation of Non-deterministic, Unrestricted, Independent And-Parallelism

0 references

Tabled evaluation with delaying for general logic programs

0 references

Parallel backtracking with answer memoing for independent and-parallelism

0 references

PARLOG: parallel programming in logic

0 references

An algebraic approach to sharing analysis of logic programs

0 references

0 references

Scaling-up reasoning and advanced analytics on BigData

0 references

GASP: Answer Set Programming with Lazy Grounding

0 references

A Case for Stale Synchronous Distributed Model for Declarative Recursive Computation

0 references

Tabling as a library with delimited control

0 references

Parallel ILP for distributed-memory architectures

0 references

0 references

0 references

Parallel bottom-up processing of datalog queries

0 references

Incremental and Modular Context-sensitive Analysis

0 references

Multivariant assertion-based guidance in abstract interpretation

0 references

Incremental Analysis of Logic Programs with Assertions and Open Predicates

0 references

Conflict-driven answer set solving: from theory to practice

0 references

0 references

The Seventh Answer Set Programming Competition: Design and Results

0 references

A review of literature on parallel constraint solving

0 references

BerkMin: A fast and robust SAT-solver

0 references

Algorithm portfolios

0 references

0 references

0 references

MULTILISP: a language for concurrent symbolic computation

0 references

0 references

Parallelizing irregular and pointer-based computations automatically: Perspectives from logic and constraint programming

0 references

An overview of Ciao and its design philosophy

0 references

0 references

0 references

Integrated program debugging, verification, and optimization using abstract interpretation (and the Ciao system preprocessor)

0 references

Strict and nonstrict independent and-parallelism in logic programs: Correctness, efficiency, and compile-time conditions

0 references

Soundness, idempotence and commutativity of set-sharing

0 references

aspeed: Solver scheduling via answer set programming

0 references

<tt>claspfolio</tt>2: Advances in Algorithm Selection for Answer Set Programming

0 references

A randomized parallel backtracking algorithm

0 references

A General Framework for Static Cost Analysis of Parallel Logic Programs

0 references

Graphs and colorings for answer set programming

0 references

0 references

Lazy Set-Sharing Analysis

0 references

Logic programs with abstract constraint atoms: the role of computations

0 references

0 references

A design and implementation of the Extended Andorra Model

0 references

Automatic inference of determinacy and mutual exclusion for logic programs using mode and type analyses

0 references

Interval-based resource usage verification by translation into Horn clauses and an application to energy consumption

0 references

A methodology for granularity-based control of parallelism in logic programs

0 references

Concurrent and Local Evaluation of Normal Programs

0 references

Precise Set Sharing Analysis for Java-Style Programs

0 references

A Flexible, (C)LP-Based Approach to the Analysis of Object-Oriented Programs

0 references

Automatic compile-time parallelization of logic programs for restricted, goal level, independent and parallelism

0 references

Compile-time derivation of variable dependency using abstract interpretation

0 references

Parallel instantiation of ASP programs: techniques and experiments

0 references

Parallel symbolic computation in ACE

0 references

ASP at Work: An ASP Implementation of PhyloWS

0 references

An optimal data structure to handle dynamic environments in non-deterministic computations

0 references

Stack splitting: a technique for efficient exploitation of search parallelism on share-nothing platforms

0 references

PALS: Efficient Or-Parallel execution of Prolog on Beowulf clusters

0 references

Abstract multiple specialization and its application to program parallelization

0 references

0 references

On applying or-parallelism and tabling to logic programs

0 references

On the Implementation of an Or-Parallel Prolog System for Clusters of Multicores

0 references

Threads and or-parallelism unified

0 references

The YAP Prolog system

0 references

Static Analysis

0 references

Resource Usage Analysis of Logic Programs via Abstract Interpretation Using Sized Types

0 references

Overview of DASWAM: Exploitation of dependent and-parallelism

0 references

Extending and implementing the stable model semantics

0 references

0 references

Practical run-time checking via unobtrusive property caching

0 references

XSB: Extending Prolog with Tabled Logic Programming

0 references

Efficient Computation of the Well-Founded Semantics over Big Data

0 references

0 references

The deevolution of concurrent logic programming languages

0 references

Negative Ternary Set-Sharing

0 references

Guarded horn clauses

0 references

The well-founded semantics for general logic programs

0 references

1983–1993: The wonder years of sequential Prolog implementation

0 references

Annotation of logic programs for independent AND-parallelism by partial evaluation

0 references

0 references

0 references

0 references

0 references

0 references

Fixpoint semantics and optimization of recursive Datalog programs with aggregates

0 references

Linear tabling strategies and optimizations

0 references

The language features and architecture of B-Prolog

0 references

Identifiers

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

10.1017/S1471068422000059

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:6063892

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q6063892&oldid=39678635"