Arthmetic constraints in eclipse

From: Christopher Jefferson <>
Date: Tue 14 Jan 2003 05:10:29 PM GMT
Message-Id: <>

I am performing a study into arithmetic constraints in CSPs and the best 
ways of representing them, so would like to be sure I know what eclipse 
currently does.

It appears to me that eclipse will multiply out all brackets and then take 
any terms from the resulting expression with more than one CSP variable in 
them and move them into a new expression, even if this is less efficient 
than taking the original statement given and factoring that into multiple 
expressions... ie solver would go:
(A+1)(B+1)=0 to
AB+A+B+1=0 to
AB=C, C+A+B+1=0

rather than:

In all cases.. is this correct?

Also what kind of pruning will solver do on the terms of the type "ABC=D" 
that it generates in this way?

I apologize if this is in the documentation but I was unable to find it and 
wished to be sure I was correct.

Received on Wed Jan 15 10:25:03 2003

This archive was generated by hypermail 2.1.8 : Wed 16 Nov 2005 06:07:21 PM GMT GMT