Dual viewpoint heuristics for binary constraint satisfaction problems
ECAI '92 Proceedings of the 10th European conference on Artificial intelligence
Constraints
CSPLIB: A Benchmark Library for Constraints
CP '99 Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming
Dual Models of Permutation Problems
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Algebraic Properties of CSP Model Operators
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Speeding up weighted constraint satisfaction using redundant modeling
AI'06 Proceedings of the 19th Australian joint conference on Artificial Intelligence: advances in Artificial Intelligence
Hi-index | 0.00 |
Based on the notions of viewpoints, models, and channeling constraints, the paper introduces model induction, a systematic transformation of constraints in an existing model to constraints in another viewpoint. Meant to be a general CSP model operator, model induction is useful in generating redundant models, which can be further induced or combined with the original model or other mutually redundant models. We propose three ways of combining redundant models using model induction, model channeling, and model intersection. Experimental results on the Langford's problem confirm that our proposed combined models exhibit improvements in efficiency and robustness over the original single models.