Removing propagation redundant constraints in redundant modeling
AuthorChoi, CW; Lee, JHM; Stuckey, PJ
Source TitleACM Transactions on Computational Logic
PublisherASSOC COMPUTING MACHINERY
University of Melbourne Author/sStuckey, Peter
AffiliationComputer Science and Software Engineering
Document TypeJournal Article
CitationsChoi, C. W., Lee, J. H. M. & Stuckey, P. J. (2007). Removing propagation redundant constraints in redundant modeling. ACM TRANSACTIONS ON COMPUTATIONAL LOGIC, 8 (4), https://doi.org/10.1145/1276920.1276925.
Access StatusThis item is currently not available from this repository
<jats:p> 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 <jats:italic>propagation redundant</jats:italic> 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 (http://www.csplib.org), how detecting and removing propagation redundant constraints in redundant modeling can speed up search by several order of magnitudes. </jats:p>
KeywordsArtificial Intelligence and Image Processing
- Click on "Export Reference in RIS Format" and choose "open with... Endnote".
- Click on "Export Reference in RIS Format". Login to Refworks, go to References => Import References