14 citations found. Retrieving documents...
Guy L. Steele, Jr. The Definition and Implementation of A Computer Programming Language based on Constraints. Ph.D. Th., Department of Computer Science, MIT, Boston, MA, 1980.

 Home/Search   Document Not in Database   Summary   Related Articles   Check  

This paper is cited in the following contexts:
Constraint Hierarchies and Logic Programming - Borning, Maher, Martindale.. (1989)   (68 citations)  (Correct)

....Independent of logic programming, constraints have proven useful for a variety of applications, including geometric layout, physical simulations, user interface design, document formatting, algorithm animation, and design and analysis of mechanical devices and electrical circuits. See for example [2, 3, 8, 13, 21, 22, 24, 27, 29, 33, 34, 35, 36], and [23] for a survey. Many such applications require some notion of defaults and preferences. If we wish to make full use of the constraint paradigm, we need ways to represent these defaults and preferences declaratively, as constraints, rather than encoding them in the procedural parts of the ....

Guy L. Steele Jr. The Definition and Implementation of a Computer Programming Language Based on Constraints. PhD thesis, MIT, August 1980. Published as MIT-AI TR 595, August 1980.


Design of a Finite Domain Constraint Programming Library for ML - Henz, Smolka (1999)   (Correct)

....engines can operate consistently on rooms and their clones. This is achieved here by faithfully copying the trail, replacing marks by dummy entries. 8 Related Work The idea that variables are connected through data structures used for exhaustive propagation appeared first in the work of Steele [Ste80] interestingly in a functional setting) the notion of search is not systematically investigated there. More recent approaches to integrate constraint programming in functional programming are based on a built in depth first engine; the system reported in [SM93a] is based on SCREAMER [SM93b] a ....

Guy Lewis Steele, Jr. The Definition and Implementation of a Computer Programming Language Based on Constraints. PhD thesis, The MIT Press, Cambridge, MA, August 1980.


Hierarchical Constraint Logic Programming - Wilson, Borning (1993)   (46 citations)  (Correct)

....in order to avoid inconsistencies. In HCLP, the need for consistency is assumed and there is no need to enumerate specifically those constraints that might conflict with the goal. Outside of logic programming, other programming languages have supported constraints. Steele s Ph.D. dissertation [71] is one of the first such efforts; an important characteristic of his system is the maintenance of dependency information to support dependency directed backtracking and to aid in generating explanations. Leler [39] describes Bertrand, a constraint language based on augmented term rewriting. ....

Guy L. Steele. The Definition and Implementation of a Computer Programming Language Based on Constraints. PhD thesis, MIT, August 1980. Published as MIT-AI TR 595, August 1980.


Kaleidoscope: A Constraint Imperative Programming Language - Gus Lopez (1993)   (11 citations)  (Correct)

.... in this area has been based in logic programming, and includes the CLP and cc (concurrent constraint) languages [Cohen 90, Colmerauer 90, Jaffar Lassez 87, Saraswat 89, Van Hentenryck 89, Van Hentenryck et al. 92, Wilson Borning 93] Other constraint languages include Steele s language [Steele Jr. 80] Bertrand [Leler 87] and Siri [Horn 92a, Horn 92b] Of these, Siri, another constraint imperative language, is the closest to Kaleidoscope. For discussions of related work beyond this brief mention, see [Borning et al. 92, Freeman Benson Borning 92b, Freeman Benson 91] The first version of ....

Guy L. Steele Jr. The Definition and Implementation of a Computer Programming Language Based on Constraints. PhD thesis, MIT, August 1980. Published as MITAI TR 595, August 1980.


Implementation And Integration Of Different Classes Of Resource.. - Le Pape (1993)   (Correct)

....decision making [5] 6] A particular constraint based mechanism can be very appropriate for deterministic predictive scheduling, but absolutely useless in a stochastic environment. Three important principles have to be respected to allow flexible reactive scheduling: the principle of locality [7], which states that each constraint relates to as few resources and activities as possible; the principle of incrementality , which states that constraints, resources and activities can be added and removed at any time; and the principle of integrability , which states that the constraint based ....

Guy Lewis Steele Jr. The Definition and Implementation of a Computer Programming Language Based on Constraints. PhD Thesis, Massachusetts Institute of Technology, 1980.


The Design and Implementation of Kaleidoscope'90, A.. - Freeman-Benson, Borning (1992)   (5 citations)  (Correct)

....artificial intelligence systems, and design, analysis, and simulation systems. See [9, 11, 21] for citations and a comparative discussion of these applications. Due to space limitations we don t describe them here. In the programming language arena, one of the earliest efforts was that of Steele [25], whose dissertation describes work on a general purpose constraint language using local propagation to find solutions. Subsequently, Leler [21] designed and implemented a constraint language based on augmented term rewriting. Lamport and Schneider [20] propose adding constraints to an imperative ....

Guy L. Steele. The Definition and Implementation of a Computer Programming Language Based on Constraints. PhD thesis, MIT, August 1980. Published as MIT-AI TR 595, August 1980.


An Incremental Algorithm for Satisfying Hierarchies of Multi-way, .. - Zanden (1995)   (26 citations)  (Correct)

.... then considering the effect that this assignment has on constraints that share variables with this constraint (thus propagating the effects of the assignment locally) Local propagation algorithms may use a number of techniques, including propagation of degrees of freedom, propagation of conflict [44, 18, 13, 40], mark sweep [21] and bipartite graph matching [15] Propagation of degrees of freedom. Propagation of degrees of freedom is the technique used by QuickPlan. Examples of systems that use this technique include SketchPad [45] and QuickPlan 39 Binary Tree Visualizer ###### ###### ###### ....

....considers whether the assignment of a method conflicts with the outputs of neighboring constraints. If so, it attempts to change the methods that satisfy the neighboring constraints, thus propagating the conflict. Examples of systems and algorithms that use this technique include CONSTRAINTS [44], Magritte [18] DeltaBlue [13, 33] and SkyBlue [41, 40] Mark sweep. Mark sweep marks all constraints that are reachable from a constraint to QuickPlan 40 List Visualizer 1 banana 2 apple 3 orange 4 mango 5 pear 6 peach 7 grape Formatted List Interface 20 40 60 80 100 number of ....

Guy L. Steele, Jr. The Definition and Implementation of A Computer Programming Language based on Constraints. Ph.D. Th., Department of Computer Science, MIT, Boston, MA, 1980.


Integrating Pointer Variables into One-Way Constraint Models - Brad Vander Zanden (1994)   (15 citations)  (Correct)

No context found.

Guy L. Steele, Jr. The Definition and Implementation of A Computer Programming Language based on Constraints. Ph.D. Th., Department of Computer Science, MIT, Boston, MA, 1980.


Interactive Multiple Representation Editing of Physically-based .. - Christopher (1994)   (Correct)

No context found.

Guy Lewis Steele, Jr. The Definition and Implementation of a Computer Programming Language. PhD thesis, Massachusetts Institute of Technology, Cambridge MA 02139, August 1980. Also MIT AI Lab TR 595.


Optical Reading of Typeset Music - Ruttenberg (1991)   (1 citation)  (Correct)

No context found.

Guy L. Steele. The definition and implementation of a computer programming language based on constraints. Technical Report AI-TR-595, Massachusetts Institute of Technology Artificial Intelligence Laboratory, 1980.


Nondeterministic Lisp as a Substrate for Constraint Logic.. - Siskind, McAllester (1993)   (21 citations)  (Correct)

No context found.

Guy Lewis Steele Jr. The Definition and Implementation of a Computer Programming Language Based on Constraints. PhD thesis, Massachusetts Institute of Technology, August 1980. Also avilable as M. I. T. VLSI Memo 80-32 and as M. I. T. Artificial Inteligence Laboratory Technical Report 595.


Screaming Yellow Zonkers - Siskind (1991)   (1 citation)  (Correct)

No context found.

Guy Lewis Steele Jr. The Definition and Implementation of a Computer Programming Language Based on Constraints. PhD thesis, Massachusetts Institute of Technology, August 1980. Also avilable as M. I. T. VLSI Memo 80--32 and as M. I. T. Artificial Inteligence Laboratory Technical Report 595.


Screaming Yellow Zonkers - Siskind (1991)   (1 citation)  (Correct)

No context found.

Guy Lewis Steele Jr. The Definition and Implementation of a Computer Programming Language Based on Constraints. PhD thesis, Massachusetts Institute of Technology, August 1980. Also avilable as M. I. T. VLSI Memo 80-32 and as M. I. T. Artificial Inteligence Laboratory Technical Report 595.


Nondeterministic Lisp as a Substrate for Constraint Logic.. - Siskind, McAllester (1993)   (21 citations)  (Correct)

No context found.

Guy Lewis Steele Jr. The Definition and Implementation of a Computer Programming Language Based on Constraints. PhD thesis, Massachusetts Institute of Technology, August 1980. Also avilable as M. I. T. VLSI Memo 80--32 and as M. I. T. Artificial Inteligence Laboratory Technical Report 595.

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