Advertisement

Locally simultaneous constraint satisfaction

  • Hiroshi Hosobe
  • Ken Miyashita
  • Shin Takahashi
  • Satoshi Matsuoka
  • Akinori Yonezawa
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 874)

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.

Keywords

Local Propagation Bipartite Graph Constraint System Solution Type Constraint Solver 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Kamada, T., Visualizing Abstract. Objects and Relations, A Constraint-Based Approach. Singapore: World Scientific, 1989.Google Scholar
  2. 2.
    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.Google Scholar
  3. 3.
    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).Google Scholar
  4. 4.
    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.Google Scholar
  5. 5.
    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.Google Scholar
  6. 6.
    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).Google Scholar
  7. 7.
    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.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Authors and Affiliations

  • Hiroshi Hosobe
    • 1
  • Ken Miyashita
    • 1
  • Shin Takahashi
    • 1
  • Satoshi Matsuoka
    • 2
  • Akinori Yonezawa
    • 1
  1. 1.Department of Information ScienceUniversity of TokyoTokyoJapan
  2. 2.Department of Mathematical EngineeringUniversity of TokyoTokyoJapan

Personalised recommendations