Abstract
Configuring consists in simulating the realization of a complex product from a catalog of component parts, using known relations between types, and picking values for object attributes. An inherent difficulty in solving configuration problems is the existence of many isomorphisms among interpretations. We describe a formalism independent approach to improve the detection of isomorphisms by configurators, which does not require to adapt the problem model. We exploit the properties of a structural subset of configuration problems, which canonical solutions can be produced or tested at low cost by an algorithm, possibly used as a symmetry breaking constraint. © Springer-Verlag 2003.
Cite
CITATION STYLE
Grandcolas, S., Henocque, L., & Prcovic, N. (2003). A canonicity test for configuration. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2833, 853–857. https://doi.org/10.1007/978-3-540-45193-8_66
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
