Abstract
Local propagation is one of the most simple and general ways to maintain the consistency of constraint problems. When some variable's values are changed or when new constraints are added, it allows to incrementally resatisfy a set of constraints by calling local solving methods. This is particularly useful for interactive applications in computer graphics including geometric design and user interface construction.
However, the great weakness of local propagation comes from cycles in the constraint graph so that local propagation is generally viewed as a weak paradigm that should be assisted by more powerful solvers. We claim that local propagation is powerful enough to tackle complex constraint maintenance problems, provided that the solving methods are expressed in a sufficiently general formalism which allows the user to express any solving method in a natural way. Thus, local propagation should be considered the main constraint maintenance engine that can pilot numeric solvers within this general formalism. This paper presents this formalism and a local propagation algorithm in two steps that can handle it.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
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).
A. Borning. ThingLab: A Constraint-Oriented Simulation Laboratory. PhD thesis, Stanford University, 1979.
A. Borning, B. Freeman-Benson, and Molly Wilson. Constraint hierarchies. Lisp and Symbolic Computation, 5(3):223–270, September 1992.
B. Chabrier. Interfaces par contraintes graphiques. PhD thesis, Université de Nice Sophia-Antipolis, 1993.
B. Freeman-Benson, J. Maloney, and A. Borning. An incremental constraint solver. Communications of the ACM, 33(1), 1990.
J. Gosling. Algebraic Constraints. PhD thesis, Carnegie-Mellon University, 1983.
J. Maloney. Using Constraints for User Interface Construction. PhD thesis, University of Washington, August 1991. PhD Thesis, published as Departement of Computer Science and Engineering Technical Report 91-08-12.
M. Sannella. The skyblue constraint solver and its applications. In Proc. workshop PPCP, Rhode Island, USA, 1993.
M. Sannella. The skyblue constraint solver. Technical Report 92-07-02, Department of Computer Science and Engineering, University of Washington, February 1993.
M. Sannella and A. Borning. Multi-garnet: Integrating multi-way constraints with garnet. Technical Report 92-07-01, Department of Computer Science and Engineering, University of Washington, September 1992.
G. Steele. The Definition and Implementation of a Computer Programming Language Based on Constraints. PhD thesis, Massachusetts Institute of Technology, 1980.
G. Sussman and G. Steele. Constraints: A language for expressing almosthierarchical descriptions. Artificial Intelligence, 14:1–39, 1980.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Trombettoni, G. (1995). Formalizing local propagation in constraint maintenance systems. In: Pinto-Ferreira, C., Mamede, N.J. (eds) Progress in Artificial Intelligence. EPIA 1995. Lecture Notes in Computer Science, vol 990. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60428-6_7
Download citation
DOI: https://doi.org/10.1007/3-540-60428-6_7
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60428-0
Online ISBN: 978-3-540-45595-0
eBook Packages: Springer Book Archive