Symbolic-interval cooperation in constraint programming

Coordination-based distributed constraint solving in DICE

“…We believe that the combination of an open-ended design, where even variable domain types are abstracted from, and an inherently distributed implementation make DICE an important addition to the existing frameworks and ad-hoc cooperation schemes. Good sources of references in this area are [6,8]. In particular, the latter reference compares the algorithm of Section 2.3 to BALI, a true solver cooperation language, of which also an IWIM/Manifold implementation is described.…”

Interval computation and constraint propagation for the optimal design of a compression spring for a linear vehicle suspension system

“…The constraint satisfaction problem "CSP" [6][7][8][9][10][11][12][13][14][15][16][17] is a programming paradigm that emerged in the 1980s to solve combinatorial problems of large sizes such as problems with planning and scheduling. It was intended to solve the mathematical problem that looks for states or objects satisfying a number of constraints.…”

“…It requires supporting tools and methodologies adapted throughout the design process [1][2][3][4]. We are interested here in problems of optimal design [5][6][7] of components and we propose an improvement to these tools and methodologies using constraint satisfaction techniques [6][7][8][9][10][11][12][13][14][15][16][17]. Our approach is applied to an optimal sizing case of a compression spring [18][19][20][21][22][23][24][25][26][27].…”

Novel Approaches to Numerical Software with Result Verification

“…Recent works have been interested in advanced propagation techniques [47], relaxations for specific problems [71,44], solver cooperation [29], processing of differential equations [20], quantified formulas [61] or applications [65,18,25,28,31,15]. The combination of box-consistency and hull-consistency has been shown to be efficient in [4].…”