An introduction to interval-based constraint processing.

Renker, Gerrit; Ahriz, Hatem

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.

Citation

RENKER, G. and AHRIZ, H. 2006. An introduction to interval-based constraint processing. Archives of control sciences, 16(2), pages 161-190.

• Journal Article Type: Article
• Acceptance Date: Dec 31, 2006
• Online Publication Date: Dec 31, 2006
• Publication Date: Dec 31, 2006
• Deposit Date: Jan 6, 2009
• Publicly Available Date: Jan 6, 2009
• Journal: Archives of control sciences
• Electronic ISSN: 2300-2611
• Publisher: De Gruyter Open
• Peer Reviewed: Peer Reviewed
• Volume: 16
• Issue: 2
• Pages: 161-190
• Keywords: Constraint programming; Interval based computation; Interval consistency techniques
• Public URL: http://hdl.handle.net/10059/285