Abstract
Yet, two classes of algorithms have been used in partial constraint satisfaction: local search methods and branch & bound search extended by the classical constraint-processing techniques like e.g. forward checking and backmarking. Both classes exhibit characteristic advantages and drawbacks. This article presents a novel approach for solving partial constraint satisfaction problems exhaustively that combines advantages of local search and extended branch & bound algorithms. This method relies on repair based search and a generic method for an exhaustive enumeration of repair steps.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Alan Borning, Bjorn Freeman-Benson, and Molly Wilson. constraint hierarchies. Lisp and Symbolic Computation, 5: 233–270, 1992.
Eugene C. Freuder and Rick J. Wallace. Partial constraint satisfaction. Artificial Intelligence, 58: 21–70, 1992.
Philippe Galinier and Jin-Kao Hao. Tabu search for maximal constraint satisfaction problems. In CP-97: Proceedings of the Third International Conference on Principles and Practice of Constraint Processing, volume 1330 of LNCS. Springer Verlag, pages 196–208, 1997.
Manfred Meyer. Finite Domain Constraints: Declarativity meets Efficiency, Theory meets Application. Dissertation, Universität Kaiserslautern, Infix Verlag, Sankt Augustin, 1994.
Harald Meyer auf’m Hofe. ConPlan/SIEDA plan: Personnel assignment as a problem of hierarchical constraint satisfaction. In PACT-97: Proceedings of the Third International Conference on the Practical Application of Constraint Technology, pages 257–272, London, UK, April 1997. Practical Application Company, Ltd.
Harald Meyer auf’m Hofe. Finding regions for local repair in hierarchical constraint satisfaction. Research Report RR-97-05, Deutsches Forschungszentrum für Künstliche Intelligenz, December 1997.
Harald Meyer auf’m Hofe and Andreas Abecker. Zur Verarbeitung “weicher” Constraints. KI-Künstliche Intelligenz, (4): 31–36, 1997.
Harald Meyer auf’m Hofe and Enno Tolzmann. ConPlan/SIEDAplan: Personaleinsatzplanung als Constraintproblem. KI-Künstliche Intelligenz, (1): 37–40, 1997.
Steven Minton, Mark Johnston, Andrew Philips, and Philip Laird. Minimizing conflicts: a heuristic repair method for constraint satisfaction problem and scheduling problems. Artificial Intelligence, 58: 161–205, 1992.
Paul Snow and Eugene C. Freuder. Improved relaxation and search methods for approximate constraint satisfaction with a maximin criterion. In Proc. of the 8 th biennal conf. of the canadian society for comput. studies of intelligence, pages 227–230, May 1990.
G. Verfaillie and T. Schiex. Solution reuse in dynamic constraint satisfaction problems. In AAAI-94: Proceedings of the 12th national conf. on AI, pages 307–312, Seattle, WA, August 1994. AAAI Press/The MIT Press.
Richard J. Wallace. Analysis of heuristic methods for partial constraint satisfaction problems. In CP-96: Proceedings of the Second International Conference o Principles and Practice of Constraint Processing, volume 1118 of LNCS. Springer Verlag, pages 482–495, 1996.
N. Yugami, Y. Ohta, and H. Hara. Improving repair-based constraint satisfaction methods by value propagation. In AAAI-94: Proceedings of the 12th National Conference on Artificial Intelligence, pages 344–349, 1994.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
auf’m Hofe, H.M. (1998). Finding regions for local repair in partial constraint satisfaction. In: Herzog, O., Günter, A. (eds) KI-98: Advances in Artificial Intelligence. KI 1998. Lecture Notes in Computer Science, vol 1504. Springer, Berlin, Heidelberg . https://doi.org/10.1007/BFb0095428
Download citation
DOI: https://doi.org/10.1007/BFb0095428
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65080-5
Online ISBN: 978-3-540-49656-4
eBook Packages: Springer Book Archive