TY  - JOUR
AU  - Choi, CW
AU  - Lee, JHM
AU  - Stuckey, PJ
Y2  - 2014/05/21
Y1  - 2007/01/01
SN  - 1529-3785
UR  - http://hdl.handle.net/11343/29248
AB  - <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>
LA  - English
PB  - ASSOC COMPUTING MACHINERY
KW  - Artificial Intelligence and Image Processing
T1  - Removing propagation redundant constraints in redundant modeling
DO  - 10.1145/1276920.1276925
IS  - ACM Transactions on Computational Logic
VL  - 8
IS  - 4
L1  - /bitstream/handle/11343/29248/277956_85483.pdf?sequence=1&isAllowed=n
ER  -