Abstract
The paper describes a simple modeling and programming approach for speeding up constraint propagation. The idea, although similar to redundant constraints, is based on the concept of redundant modeling. We define CSP model and model redundancy formally, and show how mutually redundant models can be combined and connected using channeling constraints. The combined model contains the original but redundant models as sub-models. Channeling constraints allow the sub-models to cooperate during constraint-solving by propagating constraints freely amongst the sub-models. This extra level of pruning and propagation activities becomes the source of execution speedup. We apply our method to the design and construction of a real-life nurse rostering system. Experimental results provide empirical evidence in line with our prediction.
Preview
Unable to display preview. Download preview PDF.
References
P. Baptiste and C. Le Pape. Disjunctive constraints for manufacturing scheduling: Principles and extensions. In Proceedings of the Third International Conference on Computer Integrated Manufacturing, Singapore, 1995.
N. Beldiceanu and E. Contejean. Introducing global constraints in CHIP. Journal of Mathematical and Computer Modelling, 17(7):57–73, 1994.
J. Bitner and E.M. Reingold. Backtrack programming techniques. Communications of the ACM, 18:651–655, 1985.
B.M.W. Cheng, J.H.M. Lee, and J.C.K. Wu. A constraint-based nurse rostering system using a redundant modeling approach. Technical report (submitted to the 8th IEEE International Conference on Tools with Artificial Intelligence), Department of Computer Science and Engineering, The Chinese University of Hong Kong, 1996.
T.H. Cormen, C.E. Leiserson, and R.L. Rivest. Introduction to Algorithms. The MIT Press, 1990.
M. Dincbas, H. Simonis, and P. Van Hentenryck. Solving the car-sequencing problem in constraint logic programming. In Proceedings of the European Conference on Artificial Intelligence, pages 290–295, 1988.
M. Dincbas, P. Van Hentenryck, H. Simonis, A. Aggoun, and T. Graf. Applications of CHIP to industrial and engineering problems. In Proceedings of the 1st International Conference on Industrial & Engineering Applications of Artificial Intelligence & Expert Systems, pages 887–892, 1988.
M. Dincbas, P. Van Hentenryck, H. Simonis, A. Aggoun, T. Graf, and F. Berthier. The constraint logic programming language CHIP. In Proceedings of the International Conference on Fifth Generation Computer Systems (FGCS'88), pages 693–702, Tokyo, Japan, December 1988.
C. Gervet. Conjunto: Constraint logic programming with finite set domains. In Logic Programming: Proceedings of the 1994 International Symposium, pages 339–358, 1994.
R.M. Haralick and G.L. Elliot. Increasing tree search efficiency for constraint satisfaction problems. Artificial Intelligence, 14:263–313, 1980.
ILOG. ILOG: Solver Reference Manual Version 3.0, 1995.
V. Kumar. Algorithms for constraint-satisfaction problems: A survey. AI Magazine, 13:32–44, 1992.
C. Le Pape. Implementation of resource constraints in Ilog schedule: A library for the development of constraint-based scheduling systems. Intelligent Systems Engineering, 3:55–66, 1994.
C. Le Pape. Resource constraints in a library for constraint-based scheduling. In Proceedings of the INRIA/IEEE Conference on Emerging Technologies and Factory Automation, Paris, France, 1995.
J. Liu and K. Sycara. Emergent constraint satisfaction through multi-agent coordinated interaction. In Proceedings of MAAMAW'93, Neuchatel, Switzerland, 1993.
A.K. Mackworth. Consistency in networks of relations. AI Journal, 8(1):99–118, 1977.
P. Marti and M. Rueher. A distributed cooperating constraints solving system. International Journal on Artificial Intelligence Tools, 4(1&2):93–113, 1995.
S. Minton, M.D. Johnston, A.B. Philips, and P. Laird. Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling. Artificial Intelligence, 58:161–205, 1992.
B.A. Nadel. Constraint satisfaction algorithms. Computational Intelligence, 5:188–224, 1989.
M. Perrett. Using constraint logic programming techniques in container port planning. ICL Technical Journal, 7(3):537–545, May 1991.
E.P.K. Tsang. Foundations of Constraint Satisfaction. Academic Press, 1993.
P. Van Hentenryck. Constraint Satisfaction in Logic Programming. The MIT Press, 1989.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cheng, B.M.W., Lee, J.H.M., Wu, J.C.K. (1996). Speeding up constraint propagation by redundant modeling. In: Freuder, E.C. (eds) Principles and Practice of Constraint Programming — CP96. CP 1996. Lecture Notes in Computer Science, vol 1118. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61551-2_68
Download citation
DOI: https://doi.org/10.1007/3-540-61551-2_68
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61551-4
Online ISBN: 978-3-540-70620-5
eBook Packages: Springer Book Archive