A box-consistency contractor based on extremal functions

6Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Interval-based methods can approximate all the real solutions of a system of equations and inequalities. The Box interval constraint propagation algorithm enforces Box consistency. Its main procedure BoxNarrow handles one function f corresponding to the revised constraint, and one variable x, replacing the other variables of f by their current intervals. This paper proposes an improved BoxNarrow procedure for narrowing the domain of x when f respects certain conditions. In particular, these conditions are fulfilled when f is polynomial. f is first symbolically rewritten into a new form g. A narrowing step is then run on the non-interval extremal functions that enclose the interval function g. The corresponding algorithm is described and validated on several numerical constraint systems. © 2010 Springer-Verlag.

Cite

CITATION STYLE

APA

Trombettoni, G., Papegay, Y., Chabert, G., & Pourtallier, O. (2010). A box-consistency contractor based on extremal functions. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6308 LNCS, pp. 491–498). Springer Verlag. https://doi.org/10.1007/978-3-642-15396-9_39

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free