Arc and path consistence revisited
Artificial Intelligence
Network-based heuristics for constraint-satisfaction problems
Artificial Intelligence
Applications of CHIP to industrial and engineering problems
IEA/AIE '88 Proceedings of the 1st international conference on Industrial and engineering applications of artificial intelligence and expert systems - Volume 2
Constraint satisfaction in logic programming
Constraint satisfaction in logic programming
Introduction to algorithms
Constraint satisfaction algorithms
Computational Intelligence
Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems
Artificial Intelligence - Special volume on constraint-based reasoning
Interchangeability preprocessing can improve forward checking search
ECAI '92 Proceedings of the 10th European conference on Artificial intelligence
Dual viewpoint heuristics for binary constraint satisfaction problems
ECAI '92 Proceedings of the 10th European conference on Artificial intelligence
A generic arc-consistency algorithm and its specializations
Artificial Intelligence
Conjunto: constraint logic programming with finite set domains
ILPS '94 Proceedings of the 1994 International Symposium on Logic programming
A Sufficient Condition for Backtrack-Free Search
Journal of the ACM (JACM)
Backtrack programming techniques
Communications of the ACM
Using Stochastic Methods to Guide Search in CLP: A Preliminary Report
ASIAN '96 Proceedings of the Second Asian Computing Science Conference on Concurrency and Parallelism, Programming, Networking, and Security
A Constraint-Based Nurse Rostering System Using a Redundant Modeling Approach
ICTAI '96 Proceedings of the 8th International Conference on Tools with Artificial Intelligence
Performance measurement and analysis of certain search algorithms.
Performance measurement and analysis of certain search algorithms.
A nurse rostering system using constraint programming and redundant modeling
IEEE Transactions on Information Technology in Biomedicine
Permutation Problems and Channelling Constraints
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
A Hybrid Approach for Solving Large Scale Crew Scheduling Problems
PADL '00 Proceedings of the Second International Workshop on Practical Aspects of Declarative Languages
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
Model induction: a new source of CSP model redundancy
Eighteenth national conference on Artificial intelligence
Breaking value symmetries in matrix models using channeling constraints
Proceedings of the 2005 ACM symposium on Applied computing
Constraint Models for the Covering Test Problem
Constraints
Automated reformulation of specifications by safe delay of constraints
Artificial Intelligence
Propagation algorithms for lexicographic ordering constraints
Artificial Intelligence
Removing propagation redundant constraints in redundant modeling
ACM Transactions on Computational Logic (TOCL)
Exploiting functional dependencies in declarative problem specifications
Artificial Intelligence
Planning and Scheduling the Operation of a Very Large Oil Pipeline Network
CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
MINION: A Fast, Scalable, Constraint Solver
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
Compact Representation of Sets of Binary Constraints
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
Guiding Search using Constraint-level Advice
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
Modeling choices in quasigroup completion: SAT vs. CSP
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
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
The range and roots constraints: specifying counting and occurrence problems
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
The rules of constraint modelling
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Propagation algorithms for lexicographic ordering constraints
Artificial Intelligence
Automated reformulation of specifications by safe delay of constraints
Artificial Intelligence
Constraint models for graceful graphs
Constraints
A parameterized local consistency for redundant modeling in weighted CSPs
AI'07 Proceedings of the 20th Australian joint conference on Advances in artificial intelligence
Evaluation of length-lex set variables
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Checking and filtering global set constraints
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Towards "propagation = logic + control"
ICLP'06 Proceedings of the 22nd international conference on Logic Programming
Symmetry and search in a network design problem
CPAIOR'05 Proceedings of the Second international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Among, common and disjoint constraints
CSCLP'05 Proceedings of the 2005 Joint ERCIM/CoLogNET international conference on Constraint Solving and Constraint Logic Programming
The range constraint: algorithms and implementation
CPAIOR'06 Proceedings of the Third international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
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 |
Thispaper describes our experience with a simple modeling and programmingapproach for increasing the amount of constraint propagationin the constraint solving process. The idea, although similarto redundant constraints, is based on the concept of redundantmodeling. We introduce the notions of CSP model and model redundancy,and show how mutually redundant models can be combined and connectedusing channeling constraints. The combined model contains themutually redundant models as sub-models. Channeling constraintsallow the sub-models to cooperate during constraint solving bypropagating constraints freely amongst the sub-models. This extralevel of pruning and propagation activities becomes the sourceof execution speedup. real-life nurse rostering system. Weperform two case studies to evaluate the effectiveness and efficiencyof our method. The first case study is based on the simple andwell-known n-queens problem, while the second casestudy applies our method in the design and construction of areal-life nurse rostering system. Experimental results provideempirical evidence in line with our prediction.