Abstract
Traditionally, constraint satisfaction systems have been considered an especially well-suited representation to configuration problems. However, a conventional constraint system with a predefined set of variables does not capture the flexibility inherent in composing systems out of a multitude of components of varying types. We propose an extended constraint satisfaction scheme that allows the incremental extension of a constraint network in accordance with the component-oriented view of configuration. Components can be individually represented and connected, while resource constraints express non-local requirements on the interaction of components. Constraints may be generative in that they lead to introduction of new variables, and are generic in that they may be defined to hold for all components of a given type.
This work was supported by Siemens AG Austria under project grant CSS (GR 21/96106/4).
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
James Bowen and Dennis Bahler. Conditional existence of variables in generalized constraint networks. In Proc. AAAI Conf., pages 215–220, 1991.
[CGS+89] R. Cunis, A. Günter, I. Syska, H. Bode, and H. Peters. Plakon — an approach to domain-independent construction. In Proc. IEA/AIE Conf., Tennessee, 1989. UTSI.
Rina Dechter. Enhancement schemes for constraint processing: Backjumping, learning and cutset decomposition. Artificial Intelligence, 41(3):273–312, 1990.
Robert M. Haralick and Gordon L. Elliott. Increasing tree search efficiency for constraint satisfaction problems. Artificial Intelligence, 14:263–313, 1980.
M. Heinrich and E.W. Jüngst. A resource-based paradigm for the configuring of technical systems from modular components. In Proc. CAIA, pages 257–264, February 1991.
Alois Haselböck and Markus Stumptner. An integrated approach for modelling complex configuration domains. In Proc. of the 13th Int. Conf. on Expert Systems, AI, and Natural Language, Avignon, May 1993.
Sanjay Mittal and Agustin Araya. A knowledge-based framework for design. In Proceedings AAAI Conference, pages 856–865, 1986.
John McDermott. R1: A rule-based configurer of computer systems. Artificial Intelligence, 19:39–88, 1982.
Sanjay Mittal and Felix Frayman. Making partial choices in constraint reasoning problems. In Proceedings AAAI Conference, pages 631–636, July 1987.
Sanjay Mittal and Felix Frayman. Towards a generic model of configuration tasks. In Proc. 11 th IJCAI, pages 1395–1401. Morgan Kaufmann Publishers, Inc., August 1989.
Sanjay Mittal and Brian Falkenhainer. Dynamic constraint satisfaction problems. In Proceedings AAAI Conference, pages 25–32, August 1990.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Stumptner, M., Haselböck, A. (1993). A generative constraint formalism for configuration problems. In: Torasso, P. (eds) Advances in Artificial Intelligence. AI*IA 1993. Lecture Notes in Computer Science, vol 728. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57292-9_68
Download citation
DOI: https://doi.org/10.1007/3-540-57292-9_68
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57292-3
Online ISBN: 978-3-540-48038-9
eBook Packages: Springer Book Archive