Abstract
Configuration tasks are an important application area in engineering design. The proposed solving techniques use either a constraint-based framework or a logic-based approach. We propose a methodology to obtains desired configuration using basic configuration cells(BCC). They are built by means of the predefined components and connections of the given configuration problem. In practical applications of configuration tasks the BCCs and configuration goals are represented according to object-oriented programming paradigm. They are mapped into a numeric constraint satisfaction problem. The transformation of a basic configuration cell into a new one generates a sequence of numeric constraint satisfaction problems. We propose an algorithm that solves this sequence of problems in order to obtain a configuration solution according to the desired requirements or that detects inconsistencies in the requirements. The integration of object- oriented and constraint programming paradigms allows us to achieve a synergy that produces results that could not be obtained if each one were working individually.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Benhamou F. and Granvilliers L.:Combining Local Consistency, Symbolic Rewriting and Interval Methods in Proceedings of AISMC-3 volume 1138 of LNCS, Springer-Verlag.(1996)44–159
Collavizza H., Delobel F. and Rueher M.:Extending consistent domains of numeric CSP Proceecings of Sixteenth IJCAI’99,Stockholm,(1999)406–411
Fox M. and Long D.:The Detection and Explotation of Symmetry in Planning Problems IJCAI’99 (1999),956–961
Gasca, R.M. Razonamiento y simulación en sistemas que integran conocimiento cualitativo y cuantitativo Ph.D.dissertation Seville University,(1998)
Gent I.P.and Barbara M. Smith Symmetry Breaking in Constraint Programming. In ECAI’2000 14th European Conference on Artificial Intelligence. (2000)
Klein R., Buchheit M.and Nutt W. Configuration as model construction:The constructive problem solving approach. In Proc. of the 3rd Int. Conference on AI in Design (1994)
Lhomme O.:Consistency Techniques for Numeric CSPs Proceedings IJCAI’93, (1993)232–238
D. Mailharro, A Classification and constraint-based framework for configuration. Artificial Intelligence for Engineering Design,Analysis and Manufacturing,12(4) (1998)
Marti P., Rueher M.:Concurrent Cooperating Solvers over Reals. Reliable Computing 3 (1997)325–333
McGuiness D.L. and Wright J.R.:Conceptual Modelling for Configuration: A description Logic-based Approach. Artificial Intelligence for Engineering Design, Analysis and Manufacturing,12(4)(1998)
Meseguer P. and Torras C. Solving Strategies for Highly Symmetric CSPs. In IJCAI’99(1999)400–411
Sabin, D. and Freuder F.Configuration as Composite Constraint Satisfaction. In Workshop Notes of AAAI Fall Symposium on Configuration AAAI Press. Menlo Park,CA (1996)28–36
Sabin D. and Weigel R. Product Configuration Frameworks-A survey. In IEEE Intelligent Systems (1998)42–49
Van Hentenryck P.,(1998)42-49 Michel L. and Deville Y. Numerica. A modeling language for global optimization The MIT Press (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gasca, R.M., Ortega, J.A., Toro, M. (2001). Structural Constraint-Based Modeling and Reasoning with Basic Configuration Cells. In: Walsh, T. (eds) Principles and Practice of Constraint Programming — CP 2001. CP 2001. Lecture Notes in Computer Science, vol 2239. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45578-7_46
Download citation
DOI: https://doi.org/10.1007/3-540-45578-7_46
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42863-3
Online ISBN: 978-3-540-45578-3
eBook Packages: Springer Book Archive