Efficient interval linear equality solving in constraint logic programming
From MaRDI portal
Publication:1597646
The implementation of an efficient linear interval constraint solver is proposed. The solver is based on the preconditioned interval Gauss-Seidel method. It is shown how the solver can be adapted into a constrained logic programming language already equipped with a nonlinear solver. The two solvers result in an interval constrained arithmetic language. Prototypes are compared with several other constraint logic programming languages.
Recommendations
- Analytic constraint solving and interval arithmetic
- An interval library: The experience of integration of logic and constraint programming
- On the combination of interval constraint solvers
- scientific article; zbMATH DE number 5370186
- An algorithm for linear constraint solving: its incorporation in a prolog meta-interpreter for CLP
Cited in
(10)- A simple and efficient Boolean solver for constraint logic programming
- Incremental constraint satisfaction for equational logic programming
- Solving linear, min and max constraint systems using CLP based on relational interval arithmetic
- A linear-time transformation of linear inequalities into conjunctive normal form
- Symbolic-interval cooperation in constraint programming
- On the cooperation of the constraint domains ℋ, ℛ, and ℱ in CFLP
- scientific article; zbMATH DE number 1950444 (Why is no real title available?)
- An algorithm for linear constraint solving: its incorporation in a prolog meta-interpreter for CLP
- An interval library: The experience of integration of logic and constraint programming
- Solving interval constraints by linearization in computer-aided design
This page was built for publication: Efficient interval linear equality solving in constraint logic programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1597646)