Abstract
Since the origins of the constraint satisfaction paradigm, its restriction to binary constraints has concentrated a significant part of the work. This is understandable because new ideas/techniques are usually much simpler to present/ elaborate by first restricting them to the binary case. (See for example the arc consistency algorithms, such as AC-3 or AC-4, which have been presented first in their binary version [10,12], before being extended to non-binary constraints [11,13].) But this inclination has highly increased in the early nineties. Authors indeed justified this restriction by the fact that any non-binary constraint network can polyniomally be converted into an equivalent binary one [6,8,5,19]. And, in most cases, they never extended their work to non-binary constraints.
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
Bacchus, F., van Beek, P.: On the conversion between non-binary and binary constraint satisfaction problems. In: Proceedings AAAI 1998, Madison WI, pp. 311–318 (1998)
Bessière, C., Meseguer, P., Freuder, E.C., Larrosa, J.: On forward checking for non-binary constraint satisfaction. In: Jaffar, J. (ed.) CP 1999. LNCS, vol. 1713, pp. 88–102. Springer, Heidelberg (1999)
Bessière, C., Freuder, E.C., Régin, J.C.: Using constraint metaknowledge to reduce arc consistency computation. Artificial Intelligence 107, 125–148 (1999)
Bessière, C., Régin, J.C.: Arc consistency for general constraint networks: preliminary results. In: Proceedings IJCAI 1997, Nagoya, Japan, pp. 398–404 (1997)
Dechter, R.: On the expressiveness of networks with hidden variables. In: Proceedings AAAI 1990, Boston MA, pp. 556–562 (1990)
Dechter, R., Pearl, J.: Tree clustering for constraint networks. Artificial Intelligence 38, 353–366 (1989)
Haralick, R.M., Elliot, G.L.: Increasing tree seach efficiency for constraint satisfaction problems. Artificial Intelligence 14, 263–313 (1980)
Janssen, P., Jégou, P., Nouguier, B., Vilarem, M.C.: A filtering process for general constraint-satisfaction problems: Achieving pairewise-consistency using an associated binary representation. In: Proceedings of the IEEE Workshop on Tools for Artificial Intelligence, Fairfax VA, pp. 420–427 (1989)
Kautz, H., Selman, B.: Unifying sat-based and graph-based planning. In: Proceedings IJCAI 1999, Stockholm, Sweden, pp. 318–325 (1999)
Mackworth, A.K.: Consistency in networks of relations. Artificial Intelligence 8, 99–118 (1977)
Mackworth, A.K.: On reading sketch maps. In: Proceedings IJCAI 1977, Cambridge MA, pp. 598–606 (1977)
Mohr, R., Henderson, T.C.: Arc and path consistency revisited. Artificial Intelligence 28, 225–233 (1986)
Mohr, R., Masini, G.: Good old discrete relaxation. In: Proceedings ECAI 1988, Munchen, FRG, pp. 651–656 (1988)
Mohr, R., Masini, G.: Running efficiently arc consistency. In: Ferraté, G., et al. (eds.) Syntactic and Structural Pattern Recognition, pp. 217–231. Springer, Heidelberg (1988)
Nadel, B.A.: Tree search and arc consistency in constraint satisfaction algorithms. In: Kanal, L., Kumar, V. (eds.) Search in Artificial Intelligence, pp. 287–342. Springer, Heidelberg (1988)
Régin, J.C.: Minimization of the number of breaks in sports scheduling problems using constraint programming. In: Proceedings DIMACS workshop on Constraint Programming and Large Scale Discrete Optimization, pp. P7:1–23 (1998)
Régin, J.C.: A filtering algorithm for constraints of difference in CSPs. In: Proceedings AAAI 1994, Seattle WA, pp. 362–367 (1994)
Régin, J.C.: The symmetric alldiff constraint. In: Proceedings IJCAI 1999, Stockholm, Sweden, pp. 420–425 (1999)
Rossi, F., Petrie, C., Dhar, V.: On the equivalence of constraint satisfaction problems. In: Proceedings ECAI 1990, Stockholm, Sweden, pp. 550–556 (1990)
Sabin, D., Freuder, E.C.: Contradicting conventional wisdom in constraint satisfaction. In: Proceedings PPCP 1994, Seattle WA, Seattle WA (1994)
Smith, B., Stergiou, K., Walsh, T.: Modelling the golomb ruler problem. In: Régin, J.C., Nuijten, W. (eds.) Proceedings IJCAI 1999 workshop on non-binary constraints, Stockholm, Sweden (1999)
Stergiou, K., Walsh, T.: Encodings of non-binary constraint satisfaction problems. In: Proceedings AAAI 1999, Orlando, FL (1999)
Van Hentenryck, P., Deville, Y., Teng, C.M.: A generic arc-consistency algorithm and its specializations. Artificial Intelligence 57, 291–321 (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
Bessière, C. (1999). Non-binary Constraints. 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_2
Download citation
DOI: https://doi.org/10.1007/978-3-540-48085-3_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66626-4
Online ISBN: 978-3-540-48085-3
eBook Packages: Springer Book Archive