Algebraic and logical semantics for CLP languages with dynamic scheduling
From MaRDI portal
Recommendations
Cited in
(5)- Constraint logic programming with dynamic scheduling: A semantics based on closure operators
- Scheduling complexity of interleaving search
- scientific article; zbMATH DE number 1692954 (Why is no real title available?)
- Independence in dynamically scheduled logic languages
- Proving correctness of constraint logic programs with dynamic scheduling
This page was built for publication: Algebraic and logical semantics for CLP languages with dynamic scheduling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4352542)