Abstract | ||
---|---|---|
Constraints describe relations that must be maintained, and provide a useful tool for such applications as interactive simulations, algorithm animation, and graphical user interface construction. We describe a major overhaul and extension to the constraint satisfaction mechanism in ThingLab, a constraint-oriented simulation laboratory written in the Smalltalk-80 language. First, a specification is presented of constraint hierarchies. Such hierarchies include both required constraints and default constraints of differing strengths, thus adding considerable expressive power to the system. Second, an algorithm for satisfying constraint hierarchies is described. The new satisfier is substantially faster than the previous version, even though it also includes new functionality. |
Year | DOI | Venue |
---|---|---|
1993 | 10.1145/38807.38812 | NATO ASI CP |
Keywords | DocType | Volume |
constraint satisfaction mechanism,considerable expressive power,required constraint,algorithm animation,default constraint,constraint hierarchy,new functionality,Smalltalk-80 language,satisfying constraint hierarchy,new satisfier | Conference | 22 |
Issue | ISSN | ISBN |
12 | 0362-1340 | 0-89791-247-0 |
Citations | PageRank | References |
42 | 11.32 | 7 |
Authors | ||
5 |
Name | Order | Citations | PageRank |
---|---|---|---|
Alan Borning | 1 | 2334 | 638.98 |
Robert Duisberg | 2 | 153 | 39.19 |
Bjørn N. Freeman-Benson | 3 | 341 | 54.15 |
Axel Kramer | 4 | 42 | 11.32 |
Michael Woolf | 5 | 42 | 11.32 |