Independence in dynamically scheduled logic languages
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1670481
- Independence and concurrent separation logic
- scientific article; zbMATH DE number 1692954
- scientific article; zbMATH DE number 1809623
- Algebraic and logical semantics for CLP languages with dynamic scheduling
- Static analysis of logic programs for independent and parallelism
- The propositional dynamic logic of deterministic, well-structured programs
- Inferring non-suspension conditions for logic programs with dynamic scheduling
- On the computational consequences of independence in propositional logic
- Independent and-parallelization of logic programs using static slicing
Cited in
(6)- Scheduling complexity of interleaving search
- scientific article; zbMATH DE number 1254022 (Why is no real title available?)
- Strict and nonstrict independent and-parallelism in logic programs: Correctness, efficiency, and compile-time conditions
- scientific article; zbMATH DE number 1956547 (Why is no real title available?)
- Scheduling optimality for the parallel execution of logic programs
- Semantic independence
This page was built for publication: Independence in dynamically scheduled logic languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2956712)