2004/04/16 by M. H. van Emden, van Emden, M. H., Belaid Moa +1
Computer Science · #Constraint Satisfaction and Optimization #D.3.1 #F.2.1 #FOS: Mathematics #G.1.0 #G.1.2 #G.1.5 #G.1.6 #I.2.8 #I.2.9 #Logic, programming, and type systems #Numerical Analysis (math.NA) #Numerical Methods and Algorithms
paper · pdf · doi:10.48550/arxiv.cs/0404034
openalex publication_date 2004/04/16 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Numerical analysis has no satisfactory method for the more realistic optimization models. However, with constraint programming one can compute a cover for the solution set to arbitrarily close approximation. Because the use of constraint propagation for composite arithmetic expressions is computationally expensive, consistency is computed with interval arithmetic. In this paper we present theorems that support, selective initialization, a simple modification of constraint propagation that allows composite arithmetic expressions to be handled efficiently.