Abstract
Local propagation is often used in graphical user interfaces to solve constraint systems that describe structures and layouts of figures. However, algorithms based on local propagation cannot solve simultaneous constraint systems because local propagation must solve constraints individually. We propose the ‘DETAIL’ algorithm, which efficiently solves systems of constraints with strengths, even if they must be solved simultaneously, by ‘dividing’ them as much as possible. In addition to multi-way constraints, it handles various other types of constraints, for example, constraints solved with the least squares method. Furthermore, it unifies the treatment of different types of constraints in a single system. We implemented a prototype constraint solver based on this algorithm, and evaluated its performance.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Kamada, T., Visualizing Abstract. Objects and Relations, A Constraint-Based Approach. Singapore: World Scientific, 1989.
Maloney, J. H., A. Borning, and B. N. Freeman-Benson, “Constraint Technology for User-Interface Construction in ThingLab II,” in Proc. of the ACM Conference on Object-Oriented Programming Systems, Languages, and Applications, Oct. 1989, pp. 381–388.
Miyashita, K., S. Matsuoka, S. Takahashi, and A. Yonezawa, “Interactive Generation of Graphical User Interfaces by Multiple Visual Examples,” in Proc. of the ACM Symposium on User Interface Software and Technology, Nov. 1994 (to appear).
Myers, B. A., D. A. Giuse, R. B. Dannenberg, B. Vander Zanden, D. S. Kosbie, E. Pervin, A. Mickish, and P. Marchal, “Garnet: Comprehensive Support for Graphical, Highly Interactive User Interfaces,” IEEE Computer, vol. 23, no. 11, Nov. 1990, pp. 71–85.
Sannella, M., B. Freeman-Benson, J. Maloney, and A. Borning, “Multi-way versus One-way Constraints in User Interfaces: Experience with the DeltaBlue Algorithm,” Technical Report 92-07-05, Department of Computer Science and Engineering, University of Washington, July 1992.
Takahashi, S., K. Miyashita, S. Matsuoka, and A. Yonezawa, “A Framework for Constructing Animations via Declarative Mapping Rules,” in Proc. of the IEEE Symposium on Visual Languages, Oct. 1994 (to appear).
Wilson, M. and A. Borning, “Hierarchical Constraint Logic Programming,” Technical Report 93-01-02a, Department of Computer Science and Engineering, University of Washington, May 1993.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hosobe, H., Miyashita, K., Takahashi, S., Matsuoka, S., Yonezawa, A. (1994). Locally simultaneous constraint satisfaction. In: Borning, A. (eds) Principles and Practice of Constraint Programming. PPCP 1994. Lecture Notes in Computer Science, vol 874. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58601-6_89
Download citation
DOI: https://doi.org/10.1007/3-540-58601-6_89
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58601-2
Online ISBN: 978-3-540-49032-6
eBook Packages: Springer Book Archive