Result: efficient interval linear equality solving in constraint logic programming: Efficient interval linear equality solving in constraint logic programming

Title:
efficient interval linear equality solving in constraint logic programming: Efficient interval linear equality solving in constraint logic programming
Authors:
Jimmy H. M. Lee, Chong-Kan Chiu
Source:
Reliable Computing. 8(2):139-174
Publisher Information:
Springer, Dordrecht, 2002.
Publication Year:
2002
Subject Terms:
preconditioning, interval Gauss-Seidel method, interval constrained arithmetic language, Numerical computation of matrix norms, conditioning, scaling, Interval and finite arithmetic, Direct numerical methods for linear systems and matrix inversion, Logic programming, logic programming language, linear interval constraint solver
Document Type:
Academic journal Article
File Description:
application/xml
ISSN:
1385-3139
DOI:
10.1023/a:1014754106275
Access URL:
https://zbmath.org/1747918
https://doi.org/10.1023/a:1014754106275
https://dblp.uni-trier.de/db/journals/rc/rc8.html#ChiuL02
https://doi.org/10.1023/A:1014754106275
https://link.springer.com/article/10.1023/A:1014754106275
http://doi.org/10.1023/A:1014754106275
Accession Number:
edsair.dedup.wf.002..0f7d74e1d3cf4ecd587e992702cf36c8
Database:
OpenAIRE

Further Information

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.