Abstract
In this paper, we propose a new language-independent representation of adhoc constraints, called a box constraint collection. Using constructive disjunction, this representation achieves domain consistency. We develop an algorithm to automatically generate a box constraint collection for a given adhoc constraint. The result is guaranteed to be complete and correct, and achieve domain consistency. The constructive disjunction propagator for the box constraint collection can be efficiently implemented using indexicals. We give correctness and completeness result for our compilation scheme, and outline optimization techniques. Experiments show that our representation is simple, compact, and propagates efficiently.
We thank the anonymous referees for their constructive comments. The work described in this paper was substantially supported by a grant from the Research Grants Council of the Hong Kong Special Administrative Region (Project no. CUHK4183/00E).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Sicstus Prolog 3.9.1 manual
Abdennadher, S., Rigotti, C.: Automatic generation of propagation rules for finite domains. In: Principles and Practice of Constraint Programming, pp. 18–34 (2000)
Anthony, S., Frisch, A.M.: Generating numerical literals during refinement. In: Džeroski, S., Lavrač, N. (eds.) ILP 1997. LNCS, vol. 1297, pp. 61–76. Springer, Heidelberg (1997)
Apt, K.R., Monfroy, E.: Automatic generation of constraint propagation algorithms for small finite domains. In: Principles and Practice of Constraint Programming, pp. 58–72 (1999)
Barták, R.: Filtering algorithms for tabular constraints. In: Proceedings of Colloqium on Implementation of Constraint and Logic Programming Systems (CICLOPS 2001), pp. 168–182 (2001)
Beldiceanu, N.: Global constraints as graph properties on structured networks of elementary constraints of the same type. Technical Report T2000-01, SICS (2000)
Carlson, B., Carlsson, M.: Compiling and executing disjunctions of finite domain constraints. In: Int. Conf. on Logic Programming, pp. 117–132 (1995)
Dao, T.B.H., Lallouet, A., Legtchenko, A., Martin, L.: Indexical-based solver learning. In: Principles and Practice of Constraint Programming, pp. 541–555 (September 2002)
Diaz, D., Codognet, P.: Design and implementation of the GNU Prolog system. Journal of Functional and Logic Programming 2001(6) (2001)
Frühwirth, T.: Theory and practice of constraint handling rules. Journal of Logic Programming 37(1–3), 95–138 (1998)
Gent, I., Walsh, T.: CSPLib:Abenchmark library for constraints. In: Principles and Practice of Constraint Programming, pp. 480–481 (1999), Available at http://www-users.cs.york.ac.uk/tw/csplib/
Law, Y.C., Lee, J.H.M.: Model induction: a new source of csp model redundancy. In: Proceedings of the 18th National Conference on Artificial Intelligence (AAAI 2002), pp. 57–71 (2002)
Mano, M.M., Kime, C.R.: Logic and Computer Design Fundamentals, 2nd edn. Prentice Hall, Englewood Cliffs (1999)
Schulte, C., Stuckey, P.J.: When do bounds and domain propagation lead to the same search space. In: 3rd Int. Conf. on Principles and Practice of Declarative Programming, pp. 115–126 (2001)
Tsang, E.: Foundations of Constraint Satisfaction. Academic Press, London (1993)
Van Hentenryck, P., Saraswat, V., Deville, Y.: Design, implementation, and evaluation of the constraint language cc(FD). Journal of Logic Programming 37(1–3), 139–164 (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cheng, C.K., Lee, J.H.M., Stuckey, P.J. (2003). Box Constraint Collections for Adhoc Constraints. In: Rossi, F. (eds) Principles and Practice of Constraint Programming – CP 2003. CP 2003. Lecture Notes in Computer Science, vol 2833. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45193-8_15
Download citation
DOI: https://doi.org/10.1007/978-3-540-45193-8_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20202-8
Online ISBN: 978-3-540-45193-8
eBook Packages: Springer Book Archive