Abstract
Many real-life Constraint Satisfaction Problems are over constrained. In order to provide some kind of solution for such problems, this paper proposes a constraint relaxation mechanism fully integrated with the constraint solver. Such a constraint relaxation system must be able to perform two fundamental tasks: identification of constraints to relax and efficient constraint suppression. Assumption-based Truth Maintenance Systems propose a uniform framework to tackle those requirements. The main idea of our proposal is to use the ATMS to record and efficiently use all the information provided by the constraint solver while checking consistency. We detail the use of ATMS in our particular scheme and enlight their efficiency by comparing them with existing algorithms or systems (Menezes' IHCS and Bessière's DnAC4).
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Christian Bessière. Arc consistency in dynamic constraint satisfaction problems. In Proceedings AAAI'91, 1991.
Patrice Boizumault, Christelle Guéret, and Narendra Jussien. Efficient labeling and constraint relaxation for solving time tabling problems. In Pierre Lim and Jean Jourdan, editors, Proceedings of the 1994 ILPS post-conference workshop on Constraint Languages/Systems and their use in Problem Modeling: Volume 1 (Applications and Modelling), Technical Report ECRC-94-38, ECRC, Munich, Germany, November 1994.
Alan Borning, Michael Maher, Amy Martindale, and Molly Wilson. Constraint hierarchies and logic programming. In Giorgio Levi and Maurizio Martelli, editors, ICLP'89: Proceedings 6th International Conference on Logic Programming, pages 149–164, Lisbon, Portugal, June 1989. MIT Press.
Xavier Cousin. Meilleures solutions en programmation logique. In Proceedings Avignon'91, 1991. In French.
Johan de Kleer. An assumption-based tms. Artificial Intelligence, 28:127–162, 1986.
Johan de Kleer. A comparison of ATMS and CSP techniques. In IJCAI-89: Proceedings 11th International Joint Conference on Artificial Intelligence, pages 290–296, Detroit, 1989.
Romuald Debruyne. DnAc6. Research Report 94-054, Laboratoire d'Informatique, de Robotique et de Micro-électronique de Montpellier, 1994. In French.
François Fages, Julian Fowler, and Thierry Sola. Handling preferences in constraint logic programming with relational optimization. In PLILP'94, Madrid, September 1994.
François Fages, Julian Fowler, and Thierry Sola. A reactive constraint logic programming scheme. In International Conference of Logic Programming, ICLP'95, Tokyo, 1995.
Bjorn Freeman-Benson, John Maloney, and Alan Borning. An incremental constraint solver. Communications of the ACM, 33(1):54–63, January 1990.
Eugene Freuder. Partial constraint satisfaction. In IJCAI-89: Proceedings 11th International Joint Conference on Artificial Intelligence, pages 278–283, Detroit, 1989.
Alois Haselböck, Thomas Havelka, and Markus Stumptner. Revising inconsistent variable assignments in constraint satisfaction problems. In Manfred Meyer, editor, Constraint Processing: Proceedings of the International Workshop at CSAM'93, St. Petersburg, July 1993, Research Report RR-93-39, pages 113–122, DFKI Kaiserslautern, August 1993.
Michael Jampel and David Gilbert. Fair Hierarchical Constraint Logic Programming. In Manfred Meyer, editor, Proceedings ECAI'94 Workshop on Constraint Processing, Amsterdam, August 1994.
Francisco Menezes, Pedro Barahona, and Philippe Codognet. An incremental hierarchical constraint solver. In Paris Kanellakis, Jean-Louis Lassez, and Vijay Saraswat, editors, PPCP'93: First Workshop on Principles and Practice of Constraint Programming, Providence RI, 1993.
Vijay Saraswat, Johan de Kleer, and Brian Williams. ATMS-based constraint programming. Technical report, Xerox PARC, October 1991.
Gilles Trombettoni. CCMA*: A Complete Constraint Maintenance Algorithm Using Constraint Programming. In Manfred Meyer, editor, Constraint Processing: Proceedings of the International Workshop at CSAM'93, St. Petersburg, July 1993, Research Report RR-93-39, pages 123–132, DFKI Kaiserslautern, August 1993.
Pascal Van Hentenryck. Incremental constraint satisfaction in logic programming. In Proceedings 6th International Conference on Logic Programming, 1989.
Pascal Van Hentenryck, Yves Deville, and Choh-Man Teng. A generic arcconsistency algorithm and its specializations. Artificial Intelligence, 57(2–3): 291–321, October 1992.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jussien, N., Boizumault, P. (1996). Implementing constraint relaxation over finite domains using assumption-based truth maintenance systems. In: Jampel, M., Freuder, E., Maher, M. (eds) Over-Constrained Systems. OCS 1995. Lecture Notes in Computer Science, vol 1106. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61479-6_28
Download citation
DOI: https://doi.org/10.1007/3-540-61479-6_28
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61479-1
Online ISBN: 978-3-540-68601-9
eBook Packages: Springer Book Archive