Abstract
Finding good problem decompositions is crucial for solving large-scale key/lock configuration problems. We present a novel approach to problem decomposition where the detection of a subproblem hierarchy is formulated as a constraint satisfaction problem (CSP) on set variables. Primitive constraints on set variables such as an inverse and a union-over-set-constraint are used to formalize properties of trees and to ensure that solutions of these CSPs represent a tree. An objective for optimizing properties of the tree is presented as well. Experimental results from an industrial prototype are reported
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
E. Andersson, E. Housos, N. Kohl, and D. Wedelin. Crew pairing optimization. In Gang Yu, editor, OR in Airline Industry, Kuwer Academic Publishers, Boston/London/Dordrecht, 1998.
B.Y. Choueiry, B. Faltings, and R. Weigel. Abstraction by interchangeability in resource allocation. In Proc. IJCAI’95, Montréal, 1995.
C. Gervet. Interval propagation to reason about sets: Definition and implementation of a practical language. Constraints. An International Journal, 1, 1997.
P. van Hentenryck, Y. Deville, and C.-M. Teng. A generic arc-consistency algorithm and its specializations. Artificial Intelligence, 57, 1992.
ILOG. Ilog Solver. vnV4.0. Reference manual and user manual, ILOG, 1997.
D. Mailharo. A classification and constraint based framework for configuration. AI-EDAM: Special Issue on Configuration, 12(4), 1998.
J.F. Puget. Programmation par contraintes orientée objet. In Intl. Conference on Expert Systems, Avignon, 1992.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Junker, U. (1998). Constraint-based Problem Decomposition for a Key Configuration Problem. In: Maher, M., Puget, JF. (eds) Principles and Practice of Constraint Programming — CP98. CP 1998. Lecture Notes in Computer Science, vol 1520. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49481-2_20
Download citation
DOI: https://doi.org/10.1007/3-540-49481-2_20
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65224-3
Online ISBN: 978-3-540-49481-2
eBook Packages: Springer Book Archive