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

DOI10.1016/0743-1066(93)00007-FzbMath0829.68023MaRDI QIDQ4327411

Manuel V. Hermenegildo, Francesca Rossi

Publication date: 6 April 1995

Published in: The Journal of Logic Programming (Search for Journal in Brave)

zbMATH Keywords

SLD resolutioncompile-time conditions

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20) Logic programming (68N17)

Related Items (9)

An overview of Ciao and its design philosophy ⋮ Optimality in goal-dependent analysis of Sharing ⋮ A General Framework for Static Cost Analysis of Parallel Logic Programs ⋮ Parallel Logic Programming: A Sequel ⋮ A compositional semantic basis for the analysis of equational Horn programs ⋮ Parallel backtracking with answer memoing for independent and-parallelism ⋮ On the interaction between sharing and linearity ⋮ Non-strict independence-based program parallelization using sharing and freeness information ⋮ Annotation Algorithms for Unrestricted Independent And-Parallelism in Logic Programs

This page was built for publication: Strict and nonstrict independent and-parallelism in logic programs: Correctness, efficiency, and compile-time conditions