OpenAIR @ RGU >
Design and Technology >
Journal articles (Computing) >
Please use this identifier to cite or link to this item:
|Title: ||An introduction to interval-based constraint processing.|
|Authors: ||Renker, Gerrit|
|Keywords: ||Constraint programming|
Interval consistency techniques
|Issue Date: ||2006|
|Publisher: ||Polish Academy of Sciences Committee of Automatic Control and Robotics|
|Citation: ||RENKER, G. and AHRIZ, H., 2006. An introduction to interval-based constraint processing. Archives of Control Sciences, 16 (2), pp. 161-190|
|Abstract: ||Constraint programming is often associated with solving problems over finite domains.
Many applications in engineering, CAD and design, however, require solving problems over
continuous (real-valued) domains. While simple constraint solvers can solve linear constraints
with the inaccuracy of floating-point arithmetic, methods based on interval arithmetic allow
exact (interval) solutions over a much wider range of problems. Applications of interval-based
programming extend the range of solvable problems from non-linear polynomials up to those
involving ordinary differential equations.
In this text, we give an introduction to current approaches, methods and implementations of
interval-based constraint programming and solving. Special care is taken to provide a uniform
and consistent notation, since the literature in this field employs many seemingly different, but
yet conceptually related, notations and terminology.|
|Appears in Collections:||Journal articles (Computing)|
All items in OpenAIR are protected by copyright, with all rights reserved.