Removing propagation redundant constraints in redundant modeling

Authors:
C. W. Choi;J. H.M. Lee;P. J. Stuckey
Affiliations:
The Chinese University of Hong Kong, Hong Kong;The Chinese University of Hong Kong, Hong Kong;NICTA Victoria Laboratory and the University of Melbourne, Australia
Venue:
ACM Transactions on Computational Logic (TOCL)
Year:
2007

Citing 13
Cited 6

An algorithm for solving the job-shop problem

Management Science
Dual viewpoint heuristics for binary constraint satisfaction problems

ECAI '92 Proceedings of the 10th European conference on Artificial intelligence
A filtering algorithm for constraints of difference in CSPs

AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
A Sufficient Condition for Backtrack-Free Search

Journal of the ACM (JACM)
Increasing Constraint Propagation by Redundant Modeling: \an Experience Report

Constraints
Using Auxiliary Variables and Implied Constraints to Model Non-Binary Problems

Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Symmetry Breaking Revisited

CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Solving the Kirkman's Schoolgirl Problem in a Few Seconds

CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Constraint programming viewed as rule-based programming

Theory and Practice of Logic Programming
Principles of Constraint Programming

Principles of Constraint Programming
Dual modelling of permutation and injection problems

Journal of Artificial Intelligence Research
Propagation redundancy for permutation channels

IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
A note on redundant rules in rule-based constraint programming

ERCIM'02/CologNet'02 Proceedings of the 2002 Joint ERCIM/CologNet international conference on Constraint solving and constraint logic programming

Symmetry Breaking Constraints for Value Symmetries in Constraint Satisfaction

Constraints
Automatic Generation of Redundant Models for Permutation Constraint Satisfaction Problems

Constraints
Propagation via lazy clause generation

Constraints
Solving the salinity control problem in a potable water system

CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
On computing minimal equivalent subformulas

CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
Towards solver-independent propagators

CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 (http://www.csplib.org), how detecting and removing propagation redundant constraints in redundant modeling can speed up search by several order of magnitudes.