Abstract
This article presents a generic scheme for adding strong local consistencies to the set of features of constraint solvers, which is notably applicable to event-based constraint solvers. We encapsulate a subset of constraints into a global constraint. This approach allows a solver to use different levels of consistency for different subsets of constraints in the same model. Moreover, we show how strong consistencies can be applied with different kinds of constraints, including user-defined constraints. We experiment our technique with a coarse-grained algorithm for Max-RPC, called Max-RPCrm, and a variant of it, L-Max-RPCrm. Experiments confirm the interest of strong consistencies for Constraint Programming tools.
This work was supported by the ANR French research funding agency, through the CANAR project (ANR-06-BLAN-0383-03).
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
Beldiceanu, N., Carlsson, M., Rampon, J.-X.: Global constraint catalog. Technical Report T2005-08. SICS (2005)
Berlandier, P.: Improving domain filtering using restricted path consistency. In: Proceedings of IEEE-CAIA 1995 (1995)
Bessière, C., Debruyne, R.: Theoretical analysis of singleton arc consistency and its extensions. Artificial Intelligence 172(1), 29–41 (2008)
Bessière, C., Régin, J.-C.: Arc consistency for general constraint networks: preliminary results. In: Proceedings of IJCAI 1997 (1997)
Bessière, C., Régin, J.-C.: Enforcing arc consistency on global constraints by solving subproblems on the fly. In: Jaffar, J. (ed.) CP 1999. LNCS, vol. 1713, pp. 103–117. Springer, Heidelberg (1999)
Bessière, C., Stergiou, K., Walsh, T.: Domain filtering consistencies for non-binary constraints. Artificial Intelligence 172(6-7), 800–822 (2008)
Bessière, C., van Hentenryck, P.: To be or not to be... a global constraint. In: Rossi, F. (ed.) CP 2003. LNCS, vol. 2833, pp. 789–794. Springer, Heidelberg (2003)
Debruyne, R., Bessière, C.: From restricted path consistency to max-restricted path consistency. In: Smolka, G. (ed.) CP 1997. LNCS, vol. 1330, pp. 312–326. Springer, Heidelberg (1997)
Debruyne, R., Bessière, C.: Domain filtering consistencies. Journal of Artificial Intelligence Research 14, 205–230 (2001)
Dechter, R., van Beek, P.: Local and global relational consistency. Theoretical Computer Science 173(1), 283–308 (1997)
Freuder, E.C.: A sufficient condition for backtrack-free search. Journal of the ACM 29(1), 24–32 (1982)
Freuder, E.C., Elfe, C.D.: Neighborhood inverse consistency preprocessing. In: AAAI/IAAI, vol. 1, pp. 202–208 (1996)
Object Management Group. Unified Modeling Language (UML) (2000-2010), http://www.omg.org/spec/UML/
Janssen, P., Jegou, P., Nouguier, B., Vilarem, M.C.: A filtering process for general constraint-satisfaction problems: achieving pairwise-consistency using an associated binary representation. In: Proc. of IEEE International Workshop on Tools for Artificial Intelligence, pp. 420–427 (1989)
Laburthe, F., Jussien, N., et al.: Choco: An open source Java constraint programming library (2008), http://choco.emn.fr/
Lecoutre, C., Cardon, S., Vion, J.: Path Consistency by Dual Consistency. In: Bessière, C. (ed.) CP 2007. LNCS, vol. 4741, pp. 438–452. Springer, Heidelberg (2007)
Lecoutre, C., Hemery, F.: A study of residual supports in arc consistency. In: Proceedings of IJCAI 2007, pp. 125–130 (2007)
Lhomme, O.: Arc-Consistency Filtering Algorithms for Logical Combinations of Constraints. In: Régin, J.-C., Rueher, M. (eds.) CPAIOR 2004. LNCS, vol. 3011, pp. 209–224. Springer, Heidelberg (2004)
Régin, J.-C.: A filtering algorithm for constraints of difference in CSPs. In: Proceedings of AAAI 1994, pp. 362–367 (1994)
Régin, J.-C., Petit, T., Bessière, C., Puget, J.-F.: An original constraint based approach for solving over constrained problems. In: Dechter, R. (ed.) CP 2000. LNCS, vol. 1894, pp. 543–548. Springer, Heidelberg (2000)
Stergiou, K.: Heuristics for dynamically adapting propagation. In: ECAI, pp. 485–489 (2008)
Stergiou, K., Walsh, T.: Inverse consistencies for non-binary constraints. In: Proceedings of ECAI, vol. 6, pp. 153–157 (2006)
van Hentenryck, P., Deville, Y., Teng, C.M.: A generic arc-consistency algorithm and its specializations. Artificial Intelligence 57, 291–321 (1992)
van Hentenryck, P., Michel, L., See, A., et al.: The Comet Programming Language and System (2001-2007), http://www.comet-online.org
Vion, J., Debruyne, R.: Light Algorithms for Maintaining Max-RPC During Search. In: Proceedings of SARA 2009 (2009)
Vion, J., Piechowiak, S.: Handling Heterogeneous Constraints in Revision Ordering Heuristics. In: Proc. of the TRICS 2010 Workshop Held in Conjunction with CP 2010 (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Vion, J., Petit, T., Jussien, N. (2011). Integrating Strong Local Consistencies into Constraint Solvers. In: Larrosa, J., O’Sullivan, B. (eds) Recent Advances in Constraints. CSCLP 2009. Lecture Notes in Computer Science(), vol 6384. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-19486-3_6
Download citation
DOI: https://doi.org/10.1007/978-3-642-19486-3_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-19485-6
Online ISBN: 978-3-642-19486-3
eBook Packages: Computer ScienceComputer Science (R0)