Efficient interval linear equality solving in constraint logic programming (Q1597646)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1747918
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient interval linear equality solving in constraint logic programming |
scientific article; zbMATH DE number 1747918 |
Statements
Efficient interval linear equality solving in constraint logic programming (English)
0 references
30 May 2002
0 references
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.
0 references
preconditioning
0 references
linear interval constraint solver
0 references
interval Gauss-Seidel method
0 references
logic programming language
0 references
interval constrained arithmetic language
0 references
0.7753678560256958
0 references
0.7710734605789185
0 references
0.7657665014266968
0 references
