John Maloney, Alan Borning, and Bjorn Freeman-Benson. "Constraint Technology for UserInterface Construction in ThingLabII". Sigplan Notices 24, 10 (Oct. 1989), 381-388. ACM Conference on Object-Oriented Programming; Systems Languages and Applications; OOPSLA'89.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....the fact that variables values are not used by the constraint solver allows an effective application of a lazy evaluation strategy for variables. The main drawback of such local propagation algorithms is their limitation to acyclical constraint graphs. However, as noted by Maloney et al. [24], cyclical constraint networks are seldom encountered in the construction of user interfaces, and limiting the constraint solver to graphs without cycles gives enough efficiency and flexibility to create highly responsive complex interactive systems. The complete process of updating the ....

Maloney J, Boming A, Freeman-Benson BN (1989), Constraint Technology for User Interface Construction in ThingLab II. Proc. OOPSLA: 381- 396.

....are drawn from this text. 2. Constraint Systems in General Constraints specify dependency relations between things . The nature of these things very much depends on the environment in which the constraints are used. Typical areas in which constraints are used are user interface control [5, 23] (with check buttons, radio buttons, bars, boxes, etc. geometric layout [24, 25, 26] with circles, rectangles, lines, points, etc. animation [5] with timetables, sprites, still images, palettes, etc. and media synchronization [3, 12] with timetables, media objects, error functions, etc. ....

Maloney J.M., Borning A., Freeman-Benson B.N. (1989). Constraint Technology for User-Interface Construction in ThingLab II, in proceedings of OOPSLA '89, pp. 381-388, ACM.

....put in three main classes: constraint based systems, the state transition diagrams, and data flow systems. The use of constraints is well demonstrated by ThingLab, which implements that notion by providing a general simulation environment where physics laws are described by means of constraints [9]. Constraints in ThingLab are bi directional to allow objects to be attached and updated simultaneously. Garnet [11] is another constraint based system where constraints are Common Lisp expressions stored in the slots of objects. Garnet offers a set of tools to assist the design and rapid ....

J. H. Maloney, A. Borning, and B. N. Freeman-Benson. Constraint technology for userinterface construction in ThingLab II. In OOPSLA'89 Proceedings, pages 381--388, Oct. 1989.

....reason why programs which use relationship objects should be greatly slower that those which do not. Various types of relationship objects have been used successfully in performance sensitive applications such as CASE tools (Grundy, Hosking, Mugridge, and Fenwick 1994) and user interface systems (Maloney, Borning, and Freeman Benson 1989; Berlage 1992) The Hotdraw event based drawing tool (Johnson 1992) was converted to use relationships (in this case, arithmetic constraints) with no noticeable change in performance (Freeman Benson 1993) Finally, it appears that compilers will be able to use information about relationships ....

Maloney, J. H., A. Borning, and B. N. Freeman-Benson (1989). Constraint technology for user-interface construction in ThingLab II. In OOPSLA Proceedings.

....but one way constraints suffice for many applications and in general are more easily managed by programmers. Researchers have adopted various approaches to storage optimization for dataflow constraints. Constant propagation allows some constraints to be removed from the system completely [16, 17]. If all the parameters of a constraint are constant, the constraint can be evaluated and replaced with the constant result. The elimination of this constraint may permit the removal of other constraints as well. Since constraints often have multiple dependencies, the savings in a fairly static ....

MALONEY, J., BORNING, A., AND FREEMAN-BENSON, B. Constraint technology for user-interface construction in ThingLabII. Sigplan Notices 24, 10 (Oct. 1989). ACM Conference on Object-Oriented Programming Systems Languages and Applications; OOPSLA '89.

....is updated if the user enters a new value into the widget (e.g. by typing, adjusting a slider, etc. Cycles in bindings are allowed, and bindings either iterate to a fixed point or can be cut off after sufficient iteration. Similar constraint systems are employed in Grow [1] Thinglab II [11], and Garnet [12] While bind and blet are the main declarative components of the PICASSO framework, the binding and constraint satisfaction mechanisms are used elsewhere. Triggers are segments of code that are executed whenever a variable or slot value changes. A typical use of triggers is to ....

Maloney, J. H., et. al. Constraint technology for user-interface construction in Thinglab II. Proc. OOPSLA '89, New Orleans, LA, October 1989.

....at improving computer based illustrators suggested the use of constraints to maintain relationships between graphical objects in illustrations. Though the use of constraints in drawing programs [Kalra 90, Nelson 85, Sutherland 63, White 88] and graphical user interfaces [Borning Duisberg 86, Maloney 89, Myers 88, Olsen 90] is not new, successful attempts at automatically inferring graphical constraints have only more recently been gaining attention. One such attempt has been made in scene beautification [Pavlidis 85] Beautification tries to clean up a completed drawing that has been roughly ....

John H. Maloney, Allan Borning, and Bjorn N. Freeman-Benson. Constraint Technology for User-Interface Construction in ThingLab II. In OOPSLA'89 Conference Proceedings, pages 381--388, New Orleans, LA, October 1989.

....net like representations of rule sets, classes, or objects. The spatial allocation of nodes may depend on adjoining nodes or the topology of edges (e.g. in order to avoid line crossing or long winding paths) This problem is addressed by many constraint oriented systems. ThingLab I [3] and II [14] are examples for describing layout of graphical objects with constraints. 16] also presented a toolkit using constraints and active values. In contrast to constraint oriented approaches we decided to provide a simpler but more compact and predictable notation for specifying layout. Furthermore, ....

J.H. Maloney, A. Borning, B.N. Freeman-Benson, Constraint Technology for User-Interface Construction in ThingLab II, ACM Sigplan Notices 24, 10 (1989), 381--388.

....of rule sets, classes, or objects. The spatial allocation of nodes may depend on adjoining nodes or the topology of edges (e.g. in order to avoid line crossing or long winding paths) This problem is (at least partially) addressed by many constraint oriented systems. ThingLab I [4] and II [29] are examples for describing layout and form of graphical objects with constraints. Garnet [30] is also a toolkit using techniques such as constraints and active values. In contrast to the constraint oriented approaches mentioned above, we decided to provide a simpler but more compact and ....

J.H. Maloney, A. Borning, B.N. Freeman-Benson, Constraint Technology for User-Interface Construction in ThingLab II, ACM Sigplan Notices 24, 10 (1989), 381--388.

....the fact that variables values are not used by the constraint solver allows an effective application of a lazy evaluation strategy for variables. The main drawback of such local propagation algorithms is their limitation to acyclical constraint graphs. However, as noted by Maloney et al. [24], cyclical constraint networks are seldom encountered in the construction of user interfaces, and limiting the constraint solver to graphs without cycles gives enough efficiency and flexibility to create highly responsive complex interactive systems. The complete process of updating the constraint ....

Maloney J, Borning A, Freeman-Benson BN (1989), Constraint Technology for User Interface Construction in ThingLab II. Proc. OOPSLA: 381396.

....net like representations of rule sets, classes, or objects. The spatial allocation of nodes may depend on adjoining nodes or the topology of edges (e.g. in order to avoid line crossing or long winding paths) This problem is addressed by many constraint oriented systems. ThingLab I [4] and II [22] are examples for describing layout of graphical objects with constraints. 27] also presented a toolkit using constraints (let ( left table (make dialog item . right table (make dialog item . graph view (make layout view . make layout dialog :layout ( vbox ( width :filler ....

J.H. Maloney, A. Borning, B.N. Freeman-Benson, Constraint Technology for User-Interface Construction in ThingLab II, ACM Sigplan Notices 24, 10 (1989), 381--388.

....interfaces, both as an aid in interface development and as an interaction paradigm. Constraints can specify spatial and semantic relationships declaratively between objects in a user interface, while an underlying constraint solver will ensure that interface meets the specification. Previous work [2, 3, 5, 16, 20, 13, 21, 22] has established that constraint systems need at least the following capabilities to be effective in graphical user interfaces: An earlier version of this paper appears in Proceedings of the Third Eurographics Workshop on ObjectOriented Graphics, Champ ery, Switzerland, October 1992. To appear ....

....Switzerland, October 1992. To appear in Advances in Object Oriented Graphics II, Springer Verlag, 1993. 2 ffl multi way constraints that can express at least simultaneous linear equations and inequations [7, 10] ffl low latency and high bandwidth feedback during direct manipulation [16] ffl incremental addition and deletion of constraints [10, 17] ffl the ability to detect causes of unsatisfiability for debugging inconsistent systems of constraints [10] ffl semantic feedback during direct manipulation to indicate valid ranges for variables and movements of objects [12] ffl ....

[Article contains additional citation context not shown here]

John H. Maloney, Alan H. Borning, and Bjorn N. Freeman-Benson. Constraint technology for user interface construction in ThingLab II. In ACM OOPSLA '89 Conference Proceedings, pages 381--388, New Orleans, LA, October 1989. -

....The results that we obtained in GLP gracefully explain why past local propagation algorithms solve constraint hierarchies, which we believe is an evidence of the usefulness of GLP as a theoretical basis for solving constraint hierarchies. In this section, we relate GLP with the DeltaBlue algorithm [22, 58, 76], which is one of the most famous algorithms that maintain constraint hierarchies with local propagation. DeltaBlue expresses constraint hierarchies as constraint graphs, which are bipartite graphs with variables and constraints as nodes. 4 In DeltaBlue, constraints are multi way . Intuitively, ....

....strength, let us quote the example from [22] as illustrated in Figure 3.3. Here the squares represent constraints, and the circles indicate variables. Also, the edges mean that variables are constrained by constraints connected with the edges, and the directed edges 4 In the papers on DeltaBlue [22, 58, 76], they do not associate constraint hierarchies with bipartite graphs. However, such a connection is often convenient to explain a certain kind of local propagation algorithms [25] CHAPTER 3. GENERALIZED LOCAL PROPAGATION 33 a b c d strong required required strong weak weak Figure 3.3: ....

[Article contains additional citation context not shown here]

Maloney, J. H., A. Borning, and B. N. Freeman-Benson, "Constraint Technology for User-Interface Construction in ThingLab II," in Proceed- BIBLIOGRAPHY 111 ings of the ACM Conference on Object-Oriented Programming Systems, Languages, and Applications (OOPSLA), Oct. 1989, pp. 381--388.

....are more powerful [4, 17, 19] but one way systems suffice for many applications and in general are more easily managed by programmers. Researchers have adopted various approaches to constraint optimization. Constant propagation allows some constraints to be removed from the system completely [12, 13]. If all the parameters of a constraint are constant, the constraint can be evaluated and replaced with the constant result. The elimination of this constraint may permit the removal of other constraints as well. Since constraints often have multiple dependencies, the savings in a fairly static ....

Maloney, J., Borning, A., and Freeman-Benson, B. Constraint technology for userinterface construction in ThingLabII. Sigplan Notices 24, 10 (Oct. 1989). ACM Conference on Object-Oriented Programming Systems Languages and Applications; OOPSLA '89.

....of rule sets, classes, or objects. The spatial allocation of nodes may depend on adjoining nodes or the topology of edges (e.g. in order to avoid line crossing or long winding paths) This problem is (at least partially) addressed by many constraint oriented systems. ThingLab I [4] and II [29] are examples for describing layout and form of graphical objects with constraints. Garnet [30] is also a toolkit using techniques such as constraints and active values. In contrast to the constraint oriented approaches mentioned above, we decided to provide a simpler but more compact and ....

J.H. Maloney, A. Borning, B.N. Freeman-Benson, Constraint Technology for User-Interface Construction in ThingLab II, ACM Sigplan Notices 24, 10 (1989), 381--388.

....of constants of arbitrary types. TBAG: A High Level Framework for Interactive, Animated 3D Graphics Applications Conal Elliott, Greg Schechter, Ricky Yeung, and Salim Abi Ezzi SunSoft, Inc. 2550 Garcia Avenue, M S MTV10 228, Mountain View, CA 94025 USA. phone:415 336 3086,6950,1791,2141 . email: conal,gds,ryeung,salim eng.sun.com. 2 [To Appear in the SIGGRAPH 94 Conference Proceedings] Parameterized reusable geometry is handled by definition and invocation of functions that produce geometry. The resulting customization power is not found in currently available graphics ....

....Our goal with respect to constraints has been to explore easy expression and application to high level (non numeric) types, rather than powerful numerical constraint solution techniques. TBAG currently uses the SkyBlue constraint satisfaction algorithm [19] which is a descendent of DeltaBlue [14] Constraints may be specified on arbitrary types of (immutable) values, and may be given different strengths. This efficient, incremental algorithm ensures that a globally optimal subset of specified constraints are satisfied. As explained below, efficiency of TBAG s constraint maintenance is ....

[Article contains additional citation context not shown here]

John H. Maloney, Alan Borning, and Bjorn N. Freeman-Benson. Constraint Technology for UserInterface Construction in ThingLab II. In OOPSLA `89 Proceedings, October 1989.

....x = 1 and x = 3 conflict. However, if x = 1 and x = 3 are associated with strong and weak respectively, the constraint system is solved by satisfying only x = 1 as shown in Figure 4b. Blue and DeltaBlue were first proposed as algorithms that solve constraint hierarchies with multi way constraints [4, 8]. The DeltaBlue algorithm determines output variables of constraints incrementally when a constraint is added or removed, and realizes constraint satisfaction without losing the efficiency of local propagation. Although constraints have become powerful as described above, local propagation has a ....

Maloney, J. H., A. Borning, and B. N. Freeman-Benson, "Constraint Technology for User-Interface Construction in ThingLab II," in Proceedings of the ACM Conference on ObjectOriented Programming Systems, Languages, and Applications, Oct. 1989, pp. 381--388.

.... to describe over constrained realworld problems by specifying constraints with hierarchical strengths or preferences [1, 2] and have been applied to various research areas such as constraint logic programming [11, 13] constraint imperative programming [3] and graphical user interfaces [8, 9]. Intuitively, in a constraint hierarchy, the stronger a constraint is, the more it influences the solutions of the hierarchy. For example, the hierarchy of the constraints strong x = 0 and weak x = 1 yields the solution x 0. This property enables programmers to specify preferential or default ....

Maloney, J. H., A. Borning, and B. N. Freeman-Benson, "Constraint Technology for User-Interface Construction in ThingLab II," in OOPSLA'89, ACM, Oct. 1989, pp. 381--388.

No context found.

John Maloney, Alan Borning and Bjorn Freeman-Benson, `Constraint technology for user-interface construction in ThingLab II', Proc. of the 1989 ACM Conference on Object-Oriented Programming Systems, Languages and Applications, ACM, New Orleans, October 1989, pp. 381--388.

....been particularly practical [45] As discussed in the introduction, our own work on constraint hierarchies originated as a rational reconstruction of the behavior of ThingLab and other constraint based systems. Our recent work on constraint based systems for user interface toolkits (ThingLab II [44, 43] and Multi Garnet [56] has used the locally predicate better comparator. This choice has been based primarily on pragmatic rather than aesthetic or theoretical grounds: the existence of efficient incremental algorithms DeltaBlue [20] and a derivative algorithm SkyBlue [55] for finding LPB ....

.... for finding a locally predicate better solution to a constraint hierarchy using local propagation is described in [20] and further analyzed in [43] 25] and [57] Constraint hierarchies as described in reference [4] have subsequently been used in a number of systems, including ThingLab II [43, 44], TRIP and TRIP II [37, 76] the Constraint Window System [16] and Multi Garnet [56] In addition to early conference publications [4, 7] constraint hierarchies are discussed in detail in [5] Most of the concepts in constraint hierarchies derive from concepts in subfields of operations research ....

John Maloney, Alan Borning, and Bjorn Freeman-Benson. Constraint Technology for UserInterface Construction in ThingLab II. In Proceedings of the 1989 ACM Conference on ObjectOriented Programming Systems, Languages and Applications, pages 381--388, New Orleans, October 1989. ACM.

.... exploration environment [33] the Constraint Window System (CWS) 12] Coral [45] Fabrik [26] the FilterBrowser user interface construction tool [11] Garnet [35] GITS [37] GROW [1] Peridot [34] Picasso [38] RENDEZVOUS [21, 22] the RTL CRTL tiled window layout system [7] and ThingLab II [31, 32]. Finally, researchers have developed several general purpose languages that use constraints, including Bertrand [30] Kaleidoscope [14, 18] Siri [23, 24] as well as a number of languages integrating constraints with logic programming including CAL [42] CHIP [9, 46] CLP(R) 27, 28] CLP(6 ) ....

....changed would be considerably more complicated. Reference [39] discusses one way to implement scatterplots using multi way constraints. The capability of having multiple editable displays of application data was used to good advantage in such systems as ThingLab I [2] Animus [10] ThingLab II [31, 32], and RENDEZVOUS [21, 22] In both ThingLabs, for example, one could have multiple views of a numeric application variable, e.g. a textual display of the number and a bar chart. If the variable were changed by some other part of the application, both views would be updated; if either of the views ....

[Article contains additional citation context not shown here]

John Maloney, Alan Borning, and Bjorn Freeman-Benson. Constraint Technology for UserInterface Construction in ThingLab II. In Proceedings of the 1989 ACM Conference on ObjectOriented Programming Systems, Languages and Applications, pages 381--388, New Orleans, October 1989. ACM.

....for arrays. 4 A Prototype Implementation In [11] we describe the design and implementation of a prototype constraint imperative language, Kaleidoscope 90. Kaleidoscope 90 is an integration of a typed dialect of Smalltalk 80 [17] and an enhanced version of the constraint system from ThingLab II [22]. This initial implementation interprets the constraint imperative programming semantics directly, resulting in a robust but very slow implementation. The interpreter is divided into three sections: a pre compiler, an imperative engine, and a constraintbased value store. The pre compiler converts ....

John Maloney, Alan Borning, and Bjorn Freeman-Benson. Constraint Technology for User-Interface Construction in ThingLab II. In Proceedings of the 1989 ACM Conference on Object-Oriented Programming Systems, Languages and Applications, New Orleans, October 1989. ACM.

No context found.

John Maloney, Alan Borning, and Bjorn Freeman-Benson. "Constraint Technology for UserInterface Construction in ThingLabII". Sigplan Notices 24, 10 (Oct. 1989), 381-388. ACM Conference on Object-Oriented Programming; Systems Languages and Applications; OOPSLA'89.

No context found.

Maloney J, Boming A, and Freeman-Benson BN. Constraint Technology for User Interface Construction in ThingLab II. In OOPSLA, 1989.

No context found.

Maloney J, Boming A, and Freeman-Benson BN. Constraint Technology for User Interface Construction in ThingLab II. In OOPSLA, 1989.

First 50 documents

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC