Show simple item record

dc.contributor.authorRenker, Gerrit
dc.contributor.authorAhriz, Hatem
dc.date.accessioned2009-01-06T16:48:43Z
dc.date.available2009-01-06T16:48:43Z
dc.date.issued2006
dc.identifier.citationRENKER, G. and AHRIZ, H., 2006. An introduction to interval-based constraint processing. Archives of Control Sciences, 16 (2), pp. 161-190en
dc.identifier.issn0004-072Xen
dc.identifier.urihttp://hdl.handle.net/10059/285
dc.description.abstractConstraint 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.en
dc.format.extent396009 bytes
dc.format.mimetypeapplication/pdf
dc.language.isoenen
dc.publisherPolish Academy of Sciences Committee of Automatic Control and Roboticsen
dc.relation.ispartofArchives of Control Sciences, Volume 16, Number 2, 2006en
dc.rightsCopyright : Polish Academy of Sciences Committee of Automatic Control and Roboticsen
dc.subjectConstraint programmingen
dc.subjectInterval-based computationen
dc.subjectInterval consistency techniquesen
dc.titleAn introduction to interval-based constraint processing.en
dc.typeJournal articlesen


Files in this item

This item appears in the following Collection(s)

Show simple item record