Abstract
In interval propagation approaches to solving nonlinear constraints over reals it is common to build stronger propagators from systems of linear equations. This, as far as we are aware, is not pursued for integer finite domain propagation. In this paper we show how we can add preconditioning GaussSeidel based propagators to an integer propagation solver. The GaussSeidel based propagators make use of interval arithmetic which is substantially slower than integer arithmetic. We show how we can build new integer propagators from the result of preconditioning that no longer require interval arithmetic to be performed. Although the resulting propagators may be slightly weaker than the original GaussSeidel propagation, they are substantially faster. We show on standard integer benchmarks how these new propagators can substantially improve propagation performance, in terms of strength of propagation and speed.
Original language  English 

Title of host publication  Proceedings of the 2007 ACM Symposium on Applied Computing 
Pages  306310 
Number of pages  5 
DOIs  
Publication status  Published  18 Oct 2007 
Externally published  Yes 
Event  ACM Symposium on Applied Computing 2007  Seoul, Korea, Republic of (South) Duration: 11 Mar 2007 → 15 Mar 2007 Conference number: 22nd https://dl.acm.org/doi/proceedings/10.1145/1244002 (Proceedings) 
Publication series
Name  Proceedings of the ACM Symposium on Applied Computing 

Conference
Conference  ACM Symposium on Applied Computing 2007 

Abbreviated title  SAC 2007 
Country  Korea, Republic of (South) 
City  Seoul 
Period  11/03/07 → 15/03/07 
Internet address 

Keywords
 Constraint programming
 Constraint propagation
 Gaussian elimination
 Linear equations