Termination of constraint logic programs
From MaRDI portal
Publication:4572011
Recommendations
- scientific article; zbMATH DE number 1223557
- On proving left termination of constraint logic programs
- Termination proofs for logic programs
- Strong termination of logic programs
- Input-Termination of Logic Programs
- Static Analysis
- Program Development in Computational Logic
- Using linear constraints for logic program termination analysis
- scientific article; zbMATH DE number 1948416
- Logic Programming
Cites work
Cited in
(14)- Proving Termination by Invariance Relations
- scientific article; zbMATH DE number 1948416 (Why is no real title available?)
- On proving left termination of constraint logic programs
- cTI: a constraint-based termination inference tool for ISO-Prolog
- Termination of simply moded logic programs with dynamic scheduling
- Termination of logic programs: the never-ending story
- Specifying termination in CSP
- Strong termination of logic programs
- \(\exists\)-Universal termination of logic programs
- Termination of floating-point computations
- Recurrence with affine level mappings is P-time decidable for CLP
- Static Analysis
- On Termination of Binary CLP Programs
- Input-Termination of Logic Programs
This page was built for publication: Termination of constraint logic programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4572011)