Abstract
We study here constraint satisfaction problems that are based on predefined, explicitly given finite constraints. To solve them we propose a notion of rule consistency that can be expressed in terms of rules derived from the explicit representation of the initial constraints.
This notion of local consistency is weaker than arc consistency for constraints of arbitrary arity but coincides with it when all domains are unary or binary. For Boolean constraints rule consistency coincides with the closure under the well-known propagation rules for Boolean constraints.
By generalizing the format of the rules we obtain a characterization of arc consistency in terms of so-called inclusion rules. The advantage of rule consistency and this rule based characterization of the arc consistency is that the algorithms that enforce both notions can be automatically generated, as CHR rules. So these algorithms could be integrated into constraint logic programming systems such as ECLiPSe.
We illustrate the usefulness of this approach to constraint propagation by discussing the implementations of both algorithms and their use on various examples, including Boolean constraints, three valued logic of Kleene, constraints dealing with Waltz’s language for describing polyhedreal scenes, and Allen’s qualitative approach to temporal logic.
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
Allen, J.F.: Maintaining knowledge about temporal intervals. Communications of ACM 26(11), 832–843 (1983)
Apt, K.R.: The essence of constraint propagation. Theoretical Computer Science 221(1-2), 179–210 (1999), Available via http://xxx.lanl.gov/archive/cs/
Dalal, M.: Efficient Propositional Constraint Propagation. In: Proceedings of the 10th National Conference on Artificial Intelligence, AAAI 1992, San Jose, California, pp. 409–414 (1992)
Dechter, R., van Beek, P.: Local and global relational consistency. Theoretical Computer Science 173(1), 283–308 (1997)
Frühwirth, T.: Theory and practice of constraint handling rules. Journal of Logic Programming 37(1–3), 95–138 (1998); Special Issue on Stuckey, P., Marriot, K. (eds.): Constraint Logic Programming
Frühwirth, T.: Constraint Handling Rules. In: Podelski, A. (ed.) Constraint Programming: Basics and Trends. LNCS, vol. 910, pp. 90–107. Springer, Heidelberg (1994)
Kleene, S.C.: Introduction to Metamathematics. van Nostrand, New York (1952)
Mackworth, A.: Consistency in networks of relations. Artificial Intelligence 8(1), 99–118 (1977)
Mohr, R., Masini, G.: Good old discrete relaxation. In: Kodratoff, Y. (ed.) Proceedings of the 8th European Conference on Artificial Intelligence (ECAI), pp. 651–656. Pitman Publishers (1988)
Waltz, D.L.: Generating semantic descriptions from drawings of scenes with shadows. In: Winston, P.H. (ed.) The Psychology of Computer Vision. McGraw Hill, New York (1975)
Winston, P.H.: Artificial Intelligence, 3rd edn. Addison-Wesley, Reading (1992)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Apt, K.R., Monfroy, E. (1999). Automatic Generation of Constraint Propagation Algorithms for Small Finite Domains. In: Jaffar, J. (eds) Principles and Practice of Constraint Programming – CP’99. CP 1999. Lecture Notes in Computer Science, vol 1713. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-48085-3_5
Download citation
DOI: https://doi.org/10.1007/978-3-540-48085-3_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66626-4
Online ISBN: 978-3-540-48085-3
eBook Packages: Springer Book Archive