Brad T. Vander Zanden. Incremental Constraint Satisfaction and Its Application to Graphical Interfaces. Ph.D. Th., Cornell University, Ithaca, NY, 1988.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....[Br uderlin, 1986] deals with 2 and 3 dimensional objects; in case of an inconsistency of the underlying CSP the user has to replace a constraint or even to delete one. Serrano and Gossard, 1987] mentions the constraint oriented philosophy of design and also allows constraints to get modified. [Vander Zanden, 1988] reports on the need to have an update mechanism which allows to propagate the modifications just along those constraints which are directly influenced by minimal change; it proposes an incremental approach in order to keep the alterations as local as possible ( principle of least astonishment ) ....

Bradley T. Vander Zanden. Incremental Constraint Satisfaction and its Application to Graphical Interfaces. Technical Report TR-88-941, Department of Computer Science, Cornell University, Ithaca, New York, USA, October 1988.

....all the abovementioned requirements, because expressive power and speed are contradictory requirements in constraint solving. In order to realize the interactive response, previous approaches have been to restrict the power of the constraint solver by employing propagational algorithms (e.g. [4, 17]) In Oak, we take a different approach, taking into account the characteristics of mouse interaction: i) the movement of the mouse is mostly continuous, and (ii) when the user is making a rapid mouse movement, errors incurred in constraint solving will be nearby indistinguishable, as long as ....

Bradley T. Vander Zanden. Incremental Constraint Satisfaction And Its Application To Graphical Interfaces. PhD thesis, Department of Computer Science, Cornell University, October 1988.

....only in batch mode. The GROW system [Barth86] provided constraints as an intrinsic part of an object oriented, graphical user interface toolkit. CONSTRAINTS [Sussman80] provided for the specification of hierarchical constraint equations for electrical circuits using local propagation. CONSTRAINT [VanderZanden88] is a language with which graphical objects and subobjects may be displayed and modified, while satisfying a set of constraint equations, ordering these equations for optimal update to ensure real time interaction. Coral [Szekely88] is a declarative language for declaring aggregate objects and ....

Vander Zanden, B. Incremental Constraint Satisfaction and Its Application to Graphical Interfaces. Cornell University TR 88-941, October 1988.

....1986 ] deals with 2 and 3 dimensional objects; in case of an inconsistency of the underlying CSP the user has to replace a constraint or even to delete one. Serrano and Gossard, 1987 ] mentions the constraint oriented philosophy of design and also allows constraints to get modified. Vander Zanden, 1988 ] reports on the need to have an update mechanism which allows to propagate the modifications just along those constraints which are directly influenced by minimal change; it proposes an incremental approach in order to keep the alterations as local as possible ( principle of least astonishment ) ....

Bradley T. Vander Zanden. Incremental Constraint Satisfaction and its Application to Graphical Interfaces. Technical Report TR-88-941, Department of Computer Science, Cornell University, Ithaca, New York, USA, October 1988.

....from one another, making use of the old output in computing a new output rather than computing from scratch. The large number of works on incremental computation in recent years and their many applications [RR93] demonstrated by various incremental algorithms such as [GM79,JG82,RTD83,Yeh83,RP88,Van88,FMB90,AHR 90,RR94] and general incremental computation approaches such as [Ear76,Pai81,PK82,Pai84,HT86, CP89,PT89,FT90,Smi90,Smi91,YS91,SH91,Sun91,Hoo92,van92,Fie93] motivated us to look for the fundamentals of incremental computation and their role in efficient computation. The goal has ....

....dealing with particular input changes. Examples include incremental parsing [GM79,JG82] incremental attribute evaluation [RTD83,Yeh83,YK88,LMOW88, Jon90] incremental data flow analysis [Zad84,RP88,Bur90,MR90,RR94] incremental circuit evaluation [AHR 90] and incremental constraint solving [Van88,FMB90] The study of dynamic graph algorithms, such as transitive closure algorithms [Yel93] can be viewed as falling into this class. These incremental algorithms are called explicit incremental algorithms by Pugh [Pug88b] and ad hoc incremental algorithms by Field [Fie91] Although efforts in ....

[Article contains additional citation context not shown here]

Bradley T. Vander Zanden. Incremental Constraint Satisfaction and its Application to Graphical Interfaces. Ph.D. dissertation, Department of 129 Computer Science, Cornell University, Ithaca, New York, 1988. Also appeared as Technical Report TR 88-941, October 1988.

....output [47] and ThingLab [3, 6] and CONSTRAINTS [78] exploit multi way constraints, where each variable can be an output. In the context of local propagation for ordinary systems, researchers have been investigated various topics, for example, incremental satisfaction of constraint systems [43, 88], treatment of pointer variables [41, 87] compilation of constraint systems [89] support of computer supported cooperative work [34] and light implementation of constraints [44] Another technique for solving ordinary systems is transformation. GITS uses a simple technique that replaces ....

Vander Zanden, B. T., "Incremental Constraint Satisfaction and Its Application to Graphical Interfaces," Tech. Rep. TR 88-941, Department of Computer, Science, Cornell University, Oct. 1988.

....1 INTRODUCTION A constraint is a relationship to be maintained among a set of variables. For example, A B=C represents the relationship that C is the sum of A and B. Constraints are widely recognized as a useful tool for user interface construction [1] 4] 10] 14] 20] 21] 23] [26]. Through constraints, relationships among user interface components and their applications can be defined declaratively, leaving the task of maintaining the relationships to a constraint solver, an algorithm that determines a plan for computing constrained values in a way that is consistent with ....

Brad Vander Zanden. Incremental Constraint Satisfaction and its Application to Graphical Interfaces. Ph.D. Thesis, Cornell University, 1988.

....to provide direct manipulation interfaces for multitudes of application data. This is possible because TRIP2 is based on our proposed model of general bi directional translation between application and picture data. The objective of declarative specification is also achieved with CONSTRAINT[34] with a schema called constraint grammar. The major difference with TRIP2, however, is that the data in an application object are accessed directly, rather than to provide the layers of abstractions as is with TRIP2. Therefore, an application and its interface become strongly interdependent with ....

Zanden, B. T. V., Incremental Constraint Satisfaction And Its Application To Graphical Interfaces. PhD thesis, Department of Computer Science, Cornell University, October 1988.

....to provide direct manipulation interfaces for multitudes of application data. This is possible because TRIP2 is based on our proposed model of general bi directional translation between application and picture data. The objective of declarative specification is also achieved with CONSTRAINT[38] with a schema called constraint grammar. The major difference with TRIP2, however, is that the data in an application object are accessed directly, rather than to provide the layers of abstractions as is with TRIP2. Therefore, an application and its interface become strongly interdependent with ....

Zanden, B. T. V. Incremental Constraint Satisfaction And Its Application To Graphical Interfaces. PhD thesis, Department of Computer Science, Cornell University, October 1988.

....particular incremental algorithms designed for particular problems dealing with particular input changes. Examples are incremental parsing [15, 18] incremental attribute evaluation [36, 49] incremental data flow analysis [38] incremental circuit evaluation [2] incremental constraint solving [45, 13], etc. The study of dynamic graph algorithms, e.g. 50] can be viewed as falling into this class. Although efforts in this class are directed towards particular incremental algorithms, they apply to a broad class of problems, e.g. any attribute grammar, any circuit, etc. In the second class, ....

B. T. Vander Zanden. Incremental constraint satisfaction and its application to graphical interfaces. Ph.D. Thesis TR 88-941, Department of Computer Science, Cornell University, October 1988.

....particular incremental algorithms designed for particular problems dealing with particular input changes. Examples are incremental parsing [15, 18] incremental attribute evaluation [35, 48] incremental data flow analysis [37] incremental circuit evaluation [2] incremental constraint solving [44, 13], etc. The study of dynamic graph algorithms, e.g. 49] can be viewed as falling into this class. Although efforts in this class are directed towards particular incremental algorithms, they apply to a broad class of problems, e.g. any attribute grammar, any circuit, etc. In the second class, ....

B. T. Vander Zanden. Incremental constraint satisfaction and its application to graphical interfaces. Ph.D. Thesis TR 88-941, Department of Computer Science, Cornell University, October 1988.

....particular incremental algorithms that deal with particular input changes to particular problems. Examples are incremental parsing[14, 17] incremental attribute evaluation [31, 45, 18] incremental data flow analysis[34, 33] incremental circuit evaluation[2] incremental constraint solving[43, 12], etc. The study of dynamic algorithms, e.g. 46, 29, 11] can be viewed as falling into this class. Although efforts in this class are directed towards particular incremental algorithms, they apply to a broad class of problems, e.g. any attribute grammar, any circuit, etc. In the second class, ....

B. T. Vander Zanden. Incremental constraint satisfaction and its application to graphical interfaces. Ph.D. Thesis TR 88-941, Department of Computer Science, Cornell University, October 1988.

No context found.

Brad T. Vander Zanden. Incremental Constraint Satisfaction and Its Application to Graphical Interfaces. Ph.D. Th., Cornell University, Ithaca, NY, 1988.

....that the right side of a rectangle should be located width pixels from the left side of the rectangle. Constraints find use in a great many applications, including spreadsheets, graphical interface toolkits [Myers et al. 1990; Barth 1986; Henry and Hudson 1988; Hudson 1994; Szekely and Myers 1988; Vander Zanden 1988; Myers 1990; Hill et al. 1994] graphical layout systems [Gosling 1983] simulation systems [Borning 1981; Borning and Duisberg 1986] animations [Duisberg 1986] programming languages [Freeman Benson 1990; Maloney 1991; Hoover 1992] and programming environments [Reps et al. 1983] For instance, ....

....that divides constraint satisfaction into two phases: 1) a planning phase that chooses a method for each constraint, and 2) an execution phase that executes each of the methods in topological order. The planning phase is based on propagation of degrees of freedom [Sutherland 1963; Borning 1981; Vander Zanden 1988] (see Section 4) The extension of the propagate degrees of freedom technique to multi output constraints and constraint hierarchies, and the development of an incremental version of this technique are the novel contributions of this paper. The execution phase may use any of the existing one way ....

Vander Zanden, B. 1988. Incremental constraint satisfaction and its application to graphical interfaces. Ph.D. thesis, Cornell University, Ithaca, NY.

....have a similar restriction [41, p. 56] In interactive systems, this restriction is a reasonable one. Indeed, we have never seen a constraint in an interactive system that violated this restriction. The constraint solver described in this paper is based on propagation of degrees of freedom [45, 3, 47]. Propagation of degrees of freedom works on a set of unsatisfied constraints. It finds a set of variables that (1) are attached to only one constraint, and (2) are output by one of the methods that is associated with the constraint. The solver selects this method to satisfy the constraint and ....

.... 2) maintain consistency between the application data and the graphical objects used to display this data, 3) maintain consistency among multiple views of data, 4) specify how graphical objects should respond to input events, and 5) hierarchically compose complex objects from simpler objects [39, 47, 49, 35, 20, 2, 4, 22, 37]. Because of their utility, dataflow constraints are now used in a wide variety of interactive applications, including spreadsheets, graphical interface toolkits [35, 2, 20, 27, 46, 47, 36, 34, 22] graphical layout systems [18] simulation systems [3, 4] animations [12] imperative programming ....

[Article contains additional citation context not shown here]

Brad T. Vander Zanden. Incremental Constraint Satisfaction and Its Application to Graphical Interfaces. Ph.D. Th., Cornell University, Ithaca, NY, 1988.

No context found.

Bradley T. Vander Zanden. Incremental Constraint Satisfaction And Its Application To Graphical Interfaces. PhD Thesis, Department of Computer Science, Cornell University, 1988.

No context found.

Vander Zanden, Brad. Incremental Constraint Satisfaction and its Application to Graphical Interfaces. Ph.D. Thesis, Cornell University, 1988.

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