Exploiting Common Subexpressions in Numerical CSPs

It is acknowledged that the symbolic form of the equations is crucial for interval-based solving techniques to efficiently handle systems of equations over the reals. However, only a few automatic transformations of the system have been proposed so far. Vu, Schichl, Sam-Haroud, Neumaier have exploited common subexpressions by transforming the equation system into a unique directed acyclic graph. They claim that the impact of common subexpressions elimination on the gain in CPU time would be only due to a reduction in the number of operations. This paper brings two main contributions. First, we prove theoretically and experimentally that, due to interval arithmetics, exploiting certain common subexpressions might also bring additional filtering/contraction during propagation. Second, based on a better exploitation of n-ary plus and times operators, we propose a new algorithm I-CSE that identifies and exploits all the "useful" common subexpressions. We show on a sample of bench...

• Type: Conference
• Year: 2008
• Where: CP
• Authors: Ignacio Araya, Bertrand Neveu, Gilles Trombettoni
• Keywords: Artificial Intelligence, Common Subexpressions, Common Subexpressions Elimination, CP 2008, Interval-based Solving Techniques