Removing propagation redundant constraints in redundant modeling
Publication in refereed journal


Times Cited
Altmetrics Information
.

Other information
AbstractA 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 (http://www.csplib.org), how detecting and removing propagation redundant constraints in redundant modeling can speed up search by several order of magnitudes. © 2007 ACM.
All Author(s) ListChoi C.W., Lee J.H.M., Stuckey P.J.
Journal nameACM Transactions on Computational Logic
Year2007
Month8
Day1
Volume Number8
Issue Number4
PublisherAssociation for Computing Machinary, Inc.
Place of PublicationUnited States
ISSN1529-3785
eISSN1557-945X
LanguagesEnglish-United Kingdom
KeywordsConstraint propagation, Redundant constraints, Redundant modeling

Last updated on 2020-02-07 at 02:03