Removing propagation redundant constraints in redundant modeling

C. W. Choi, J. H.M. Lee, P. J. Stuckey

Research output: Contribution to journalArticleResearchpeer-review

11 Citations (Scopus)


A widely adopted approach to solving constraint satisfaction problems combines systematic tree search with various degrees of constraint propagation for pruning the search space. One common technique to improve the execution efficiency is to add redundant constraints, which are constraints logically implied by others in the problem model. However, some redundant constraints are propagation redundant and hence do not contribute additional propagation information to the constraint solver. Redundant constraints arise naturally in the process of redundant modeling where two models of the same problem are connected and combined through channeling constraints. In this paper, we give general theorems for proving propagation redundancy of one constraint with respect to channeling constraints and constraints in the other model. We illustrate, on problems from CSPlib (, how detecting and removing propagation redundant constraints in redundant modeling can speed up search by several order of magnitudes.

Original languageEnglish
Article number1276925
JournalACM Transactions on Computational Logic
Issue number4
Publication statusPublished - 1 Aug 2007
Externally publishedYes


  • Constraint propagation
  • Redundant constraints
  • Redundant modeling

Cite this