G.L. Steele, The Implementation and Definition of a Computer Programming Language Based on Constraints, Ph.D. Dissertation (MIT-AI TR 595), Dept. of Electrical Engineering and Computer Science, M.I.T. 1980.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....from MIT, motivated by applications in electrical circuit analysis and synthesis, gave rise to languages for general problem solving. In the CONSTRAINTS language [240] variables and constraints are static, and constraint solving was limited to using local propagation. An extension of this work [241] provided a more sophisticated environment for constraint programming, including explanation facilities. Some other related systems, EL ARS [238] and SYN [142] used the constraint solver MACSYMA [186] to avoid the restrictions of local propagation. It was noted at this period [241] that there was ....

....of this work [241] provided a more sophisticated environment for constraint programming, including explanation facilities. Some other related systems, EL ARS [238] and SYN [142] used the constraint solver MACSYMA [186] to avoid the restrictions of local propagation. It was noted at this period [241] that there was a conceptual correspondence between the constraint techniques and logic programming. The REF ARF system [89] was also designed for problem solving. One component, REF, was essentially a procedural language, but with nondeterminism because of constraints used in conditional ....

G.L. Steele, The Implementation and Definition of a Computer Programming Language Based on Constraints, Ph.D. Dissertation (MIT-AI TR 595), Dept. of Electrical Engineering and Computer Science, M.I.T. 1980.

....dissertation. 2 Background and Related Work The idea of explicitly using constraints for problem specification can be traced to the work of Sutherland [86] who was interested in designing graphical user interfaces. Constraint programming and logic programming developed independently until Steele [82] noted that there was a conceptual correspondence between them. Jaffar and Lassez [36] introduced constraint logic programming (CLP) by integrating logic programming with constraint programming. van Hentenryck [93] also showed how to incorporate constraint solving ability into a logic programming ....

G. L. Steele. The Implementation and Definition of a Computer Programming Language Based on Constraints. PhD thesis, MIT, 1980.

....the body of the paper. Omitted proofs of proposition lemmas theorems may be found in Govindarajan s dissertation [12] 2 Related Work The use of constraints for problem modeling can be traced to the work on Sketchpad by Sutherland [34] More recent works include the constraint language of Steele [33] and Borning s Thinglab [3] and Leler s Bertrand language [25] A major breakthrough was achieved by Jaffar and Lassez [17] who integrated logic programming with constraint solving in their CLP family of languages. Another important work is that of van Hentenryck [36] who showed how to ....

G. L. Steele. The Implementation and Definition of a Computer Programming Language Based on Constraints. PhD thesis, MIT, 1980.

....a specification of the data dependencies required by such an operation before it can proceed. Extensions, such as the I structures of [2] are used to provide a delay mechanism for lazy functions and complex data structures such as arrays in the context of dataflow. In local propagation, see e.g. [11], the solving of a constraint is delayed until enough of its variables have known values in order that the remaining values can be directly computed. Solving a constraint can then cause other constraints to have their values locally propagated, etc. The concept and its implementation are logical ....

G.L. Steele, "The Implementation and Definition of a Computer Programming Language Based on Constraints", Ph.D. Dissertation (MIT-AI TR 595), Dept. of Electrical Engineering and Computer Science, M.I.T.

....the constraints the constraint solver. There are many approaches to solving a given set of (numerical) constraints. One I I I T 1 2 V 1 2 R R Figure 1: Simple Resistive Circuit approach is local propagation. This is the sole method for solving arithmetic constraints in the work of Steele [16, 17], in PROLOG systems including MU Prolog [12] and NU Prolog [19] and elsewhere. A system of constraints is solved by local propagation if all the variables in the system become determined after a finite number of local propagation steps. A local propagation step occurs when a constraint has a ....

Steele, G. L. Jr. "The Implementation and Definition of a Computer Programming Language Based on Constraints", Ph.D. Dissertation, Dept. Electrical Engineering and Computer Science. MIT, Cambridge, Mass., Aug. 1980. (MIT--AI TR 595)

No context found.

G. L. Steele. The implementation and definition of computer programming language basedonconstraints. PhD thesis, MIT, Department of Eletrical Engineering and computer Science, August 1980.

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