Abstract
This paper introduces a model for dynamic constraint problems in which constraints and variables are comparable entities. This model provides a natural way to represent configuration or design problems wherein the set of objects and their constraints are bound to evolve during the solving process. Metaconstraints, i.e. constraints on constraint descriptions, are the central contribution of the model. Depending on which part of the description (the set of constrained variables or the relation that links them) they apply to, metaconstraints can be used to monitor the evolution of the problem's variables or constraints. The implications of metaconstraints on the consistency maintenance process are studied and an implementation within the Prose constraint language is briefly described.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
P. Berlandier. A Study of Constraint Interpretation Mechanisms and of their Integration in a Knowledge Representation Language. PhD thesis, University of Nice, 1992. (in french).
G. Berry and G. Gonthier. The esterel synchronous programming language: Design, semantics, implementation. Rapport de Recherche 842, INRIA Sophia Antipolis, 1988.
J. Bowen and D. Bahler. Conditional existence of variable in generalized constraint networks. In Proc. AAAI, 1991.
J. Cohen. Constraint logic programming languages. Communications of the ACM, 33(7), 1990.
A. Borning et al. Constraint hierarchies. In Proc. OOPSLA, 1987.
E. Freuder. Partial constraint satisfaction. In Proc. IJCAI, Detroit, Michigan, 1989.
J. Gosling. Algebraic Constraints. PhD thesis, Carnegie-Mellon University, 1983.
H. Güsgen and J. Hertzberg. A Perspective of Constraint-Based Reasoning, volume 597 of Lecture Notes in Artificial Intelligence. Springer-Verlag, 1992.
P. Van Hentenryck, H. Simonis, and M. Dincbas. Constraint satisfaction using constraint logic programming. Artificial Intelligence, 58:113–159, 1992.
K. Hua, B. Faltings, and D. Haroud. Dynamic Constraint Satisfaction in a Bridge Design System, volume 462 of Lecture Notes in Artificial Intelligence, pages 217–232. Springer-Verlag, 1990.
ILOG, 2 Av. Galliéni, F-94253 Gentilly. Smeci Version 1.3, Users' Reference Manual, 1988.
ILOG, 2 Av. Galliéni, F-94253 Gentilly. Le_Lisp Version 16, Users' Reference Manual, 1992.
V. Kumar. Algorithms for constraint satisfaction problems: A survey. AI Magazine, 13(1):32–44, 1992.
S. Mittal and B. Falkenhainer. Dynamic constraint satisfaction problems. In Proc. AAAI, 1990.
U. Montanari. Networks of constraints: Fundamental properties and application to picture processing. Information Science, 7(3):95–132, 1974.
G. Steele. The Definition and Implementation of a Computer Programming Language Based on Constraints. PhD thesis, Massachusetts Institute of Technology, 1980.
M. Wilk. Change propagation in object dependency graphs. In Proc. Technology of Object-Oriented Languages and Systems (TOOLS USA), 1991.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Berlandier, P. (1993). The use and interpretation of meta level constraints. In: Filgueiras, M., Damas, L. (eds) Progress in Artificial Intelligence. EPIA 1993. Lecture Notes in Computer Science, vol 727. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57287-2_53
Download citation
DOI: https://doi.org/10.1007/3-540-57287-2_53
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57287-9
Online ISBN: 978-3-540-48036-5
eBook Packages: Springer Book Archive