Result: Efficient interval linear equality solving in constraint logic programming

Title:
Efficient interval linear equality solving in constraint logic programming
Authors:
CHIU, Chong-Kan, HO-MAN LEE, Jimmy
Source:
Reliable computing. 8(2):139-174
Publisher Information:
Heidelberg: Springer, 2002.
Publication Year:
2002
Physical Description:
print, 58 ref
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Mathematics, Mathématiques, Sciences exactes et technologie, Exact sciences and technology, Sciences et techniques communes, Sciences and techniques of general use, Mathematiques, Mathematics, Analyse numérique. Calcul scientifique, Numerical analysis. Scientific computation, Analyse numérique, Numerical analysis, Méthodes numériques en programmation mathématique, optimisation et calcul variationnel, Numerical methods in mathematical programming, optimization and calculus of variations, Programmation mathématique numérique, Numerical methods in mathematical programming, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Informatique théorique, Theoretical computing, Théorie des langages et analyse syntaxique, Language theory and syntactical analysis, Arithmétique intervalle, Interval arithmetic, Aritmética intervalo, Contrainte égalité, Equality constraint, Constreñimiento igualdad, Langage programmation, Programming language, Lenguaje programación, Méthode Gauss Seidel, Gauss Seidel method, Método Gauss Seidel, Programmation logique avec contrainte, Constraint logic programming, Programación lógica con restricción, Programmation logique, Logical programming, Programación lógica, Satisfaction contrainte, Constraint satisfaction, Satisfaccion restricción, Variabilité, Variability, Variabilidad
Document Type:
Academic journal Article
File Description:
text
Language:
English
Author Affiliations:
Department of Computer Science and Engineering, The Chinese University of Hong Kong, Shatin, N.T, Hong-Kong
ISSN:
1385-3139
Access URL:
http://pascal-francis.inist.fr/vibad/index.php?action=search&terms=13581797
Rights:
Copyright 2002 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems

Mathematics
Accession Number:
edscal.13581797
Database:
PASCAL Archive

Further Information

Existing interval constraint logic programming languages, such as BNR Prolog, work under the framework of interval narrowing and are deficient in solving systems of linear constraints over real numbers, which constitute an important class of problems in engineering and other applications. In this paper, we suggest to separate linear equality constraint solving from inequality and non-linear constraint solving. The implementation of an efficient interval linear constraint solver, which is based on the preconditioned interval Gauss-Seidel method, is proposed. We show how the solver can be adapted to incremental execution and incorporated into a constraint logic programming language already equipped with a non-linear solver based on interval narrowing. The two solvers share common interval variables, interact and cooperate in a round-robin fashion during computation, resulting in an efficient interval constraint arithmetic language CIAL. The CIAL prototypes, based on CLP(R), are constructed and compared favorably against several major interval constraint logic programming languages.