Held in conjunction with the Twelfth International Conference on Principles and Practice of Constraint Programming (CP 2006) Preface

Constraint Propagation is an essential part of many constraint programming systems. Sitting at the heart of a constraint solver, it consumes a significant portion of the time that is required for problem solving. The Third International Workshop on Constraint Propagation and Implementation (CPAI’06) was convened to study the design and analysis of new propagation algorithms as well as any related practical issue. The implementation and evaluation of constraint propagation algorithms is studied in contexts ranging from special purpose solvers to programming language systems. of an invited talk, deliverd by Chris Jefferson, and seven contributed papers. In his talk Chris Jefferson presents his solver Minion. The contributed papers present filtering algorithms for precedence and dependency constraints, a new global meta-constraint called SLIDE, a study of residual supports in arc consistency, algorithms for maintaining singleton arc consistency, algorithms for probabilistic singleton arc consistency, improvements and simplifications of the SPREAD constraint, and filtering algorithm