Abstract
In recent years, many constraint-specific filtering algorithms have been introduced. Such algorithms use the semantics of the constraint to perform filtering more efficiently than a generic algorithm. The usefulness of such methods has been widely proven for solving constraint satisfaction problems. In this paper, we extend this concept to overconstrained problems by associating specific filtering algorithms with constraints that may be violated. We present a paradigm that places no restrictions on the constraint filtering algorithms used. We illustrate our method with a complete study of the All-different constraint.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
R. Ahuja, T. Magnanti, and J. Orlin. Networks flows: theory, algorithms, and applications. Prentice Hall, Inc., 1993.
N. Beldiceanu and E. Contejean. Introducing global constraints in chip. Journal of Mathematical and Computer Modelling, 20(12):97–123, 1994.
S. Bistarelli, U. Montanari, F. Rossi, T. Schiex, G. Verfaillie, and H. Fargier. Semiring-based CSPs and valued CSPs: Frameworks, properties, and comparison. Constraints, 4:199–240, 1999.
R. Dechter. Constraint networks. Encyclopedia of Artificial Intelligence, pages 276–285, 1992.
L. Ford and D. Flukerson. Flows in networks. Princeton University Press, 1962.
E. Freuder and R. Wallace. Partial constraint satisfaction. Artificial Intelligence, 58:21–70, 1992.
I. Gent, K. Stergiou, and T. Walsh. Decomposable constraints. Artificial Intelligence, 123:133–156, 2000.
J. Larrosa, P. Meseguer, and T. Schiex. Maintaining reversible DAC for MAX-CSP. Artificial Intelligence, 107:149–163, 1999.
T. Petit, J.-C. Régin, and C. Bessière. Meta constraints on violations for over constrained problems. Proceedings ICTAI, pages 358–365, 2000.
J.-C. Régin. A filtering algorithm for constraints of difference in CSPs. Proceedings AAAI, pages 362–367, 1994.
J.-C. Régin. Développement d’outils algorithmiques pour l’Intelligence Artificielle. Application á la Chimie Organique. Ph.D. Dissertation, Université Montpellier II, 1995.
J.-C. Régin. Generalized arc consistency for global cardinality constraint. Proceedings AAAI, pages 209–215, 1996.
J.-C. Régin, T. Petit, C. Bessiére, and J.-F. Puget. An original constraint based approach for solving over constrained prolems. Proceedings CP, pages 543–548, 2000.
T. Schiex. Arc consistency for soft constraints. Proceedings CP, pages 411–424, 2000.
G. Verfaillie, M. Lemaître, and T. Schiex. Russian doll search for solving constraint optimisation problems. Proceedings AAAI, pages 181–187, 1996.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Petit, T., Régin, JC., Bessière, C. (2001). Specific Filtering Algorithms for Over-Constrained Problems. In: Walsh, T. (eds) Principles and Practice of Constraint Programming — CP 2001. CP 2001. Lecture Notes in Computer Science, vol 2239. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45578-7_31
Download citation
DOI: https://doi.org/10.1007/3-540-45578-7_31
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42863-3
Online ISBN: 978-3-540-45578-3
eBook Packages: Springer Book Archive