|
ABSTRACT
One-way dataflow constraints have gained popularity in many types of interactive systems because of their simplicity, efficiency, and manageability. Although it is widely acknowledged that multiway dataflow constraint could make it easier to specify certain relationships in these applications, concerns about their predictability and efficiency have impeded their acceptance. Constraint hierarchies have been developed to address the predictability problem, and incremental algorithms have been developed to address the efficiency problem. However, existing incremental alogrithms for satisfying constraint hierarchies encounter two difficulties : (1) they are incapable of guaranteeing an acylic solution if a constraint hierarchy has one or more cyclic solutions and (2) they require worst-case exponential time to satisfy systems of multioutput constriants. This article surmounts these difficulties by presenting an incremental algorithm called QuickPlan that satisfies in worst-case O(N2) time any hierarchy of multiway, multiout-put dataflow constraint that has at least one acyclic solution, where N is the number of constraints. With benchmarks and real problems that can be solved efficiently using exisitng algorithms, its performance is competitive or superior. With benchmarks and real problems that cannot be solved using exisitng algorithms or that cannot be solved efficiently, QuickPlan finds solutions and does so efficiently, typically in O(N) time or less. QuickPlan is based on the strategy of propagation of degrees of freedom. The only restriction it imposes is that every constraint method must use all of the variables in the constraint as either an input or an output variable. This requirement is met in every constraint-based, interactive application that we have developed or seen.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
Bowen Alpern , Roger Hoover , Barry K. Rosen , Peter F. Sweeney , F. Kenneth Zadeck, Incremental evaluation of computational circuits, Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms, p.32-42, January 22-24, 1990, San Francisco, California, United States
|
 |
2
|
|
 |
3
|
|
 |
4
|
|
 |
5
|
Alan Borning , Robert Duisberg , Bjorn Freeman-Benson , Axel Kramer , Michael Woolf, Constraint hierarchies, Conference proceedings on Object-oriented programming systems, languages and applications, p.48-60, October 04-08, 1987, Orlando, Florida, United States
|
| |
6
|
|
| |
7
|
BORNING, A., MAHER, M., MARTINDALE, A., AND WILSON, M. 1989. Constraint hierarchies and logic programming. In Proceedings of the 6th International Logic Programming Conference (Lisbon, Portugal). 149-164.
|
 |
8
|
|
| |
9
|
|
| |
10
|
DINCBAS, M., HENTENRYCK, P. V., SIMONIS, H., AGGOUN, A., GRAF, T., AND BERTHEIR, F. 1988. The constraint logic programming language Chip. In Proceedings of the International Conference on Fifth Generation Computer Systems 1988. ICOT, Tokyo, 249-264.
|
| |
11
|
|
 |
12
|
Bjorn N. Freeman-Benson, Kaleidoscope: mixing objects, constraints, and imperative programming, Proceedings of the European conference on object-oriented programming on Object-oriented programming systems, languages, and applications, p.77-88, September 1990, Ottawa, Canada
|
 |
13
|
|
| |
14
|
GANGNET, M. AND ROSENBERG, B. 1992. Constraint programming and graph algorithms. In the 2nd International Symposium on Artificial Intelligence and Mathematics.
|
| |
15
|
GLEICHER, M. AND WITKIN, A. 1991. Differential manipulation. In Proceedings of Graphics Interface. 61-67.
|
 |
16
|
|
| |
17
|
|
| |
18
|
GOSLING, J. 1983. Algebraic constraints. Tech. Rep. CMU-(X-83-132, Computer Science Dept., Carnegie Mellon Univ., Pittsburgh, Pa.
|
| |
19
|
Richard Helm , Tien Huynh , Catherine Lassez , Kim Marriot, A linear constraint technology for interactive graphic systems, Proceedings of the conference on Graphics interface '92, p.301-309, September 1992, Vancouver, British Columbia, Canada
|
 |
20
|
|
 |
21
|
|
 |
22
|
|
| |
23
|
|
 |
24
|
|
 |
25
|
|
 |
26
|
|
| |
27
|
HUYNH, T., b%SEZ, C., AND LASSEZ, J.-L. 1992. Practical issues on the projection of polyhedral sets. Ann. Math. Artif. Zntell. 6, 295-316.
|
 |
28
|
|
| |
29
|
LASSEZ, C. AND bSSEZ, J.-L. 1991. Quantifier elimination for conjunctions of linear constraints via a convex hull algorithm. Tech. Rep. Res. Rep. RC 16779, IBM.
|
| |
30
|
|
| |
31
|
|
 |
32
|
|
| |
33
|
Brad A. Myers , Dario A. Giuse , Roger B. Dannenberg , David S. Kosbie , Edward Pervin , Andrew Mickish , Brad Vander Zanden , Philippe Marchal, Garnet: Comprehensive Support for Graphical, Highly Interactive User Interfaces, Computer, v.23 n.11, p.71-85, November 1990
[doi> 10.1109/2.60882]
|
 |
34
|
|
| |
35
|
|
| |
36
|
|
 |
37
|
|
| |
38
|
SANNELLA, M. AND BORNING, A. 1992. Multi-Garnet: Integrating multi-way constraints with Garnet. Tech. Rep. 92-07-01, Dept. of Computer Science and Engineering, University of Wash., Seattle, Wash. Sept.
|
| |
39
|
|
| |
40
|
|
| |
41
|
STEELE, G. L., JR. 1980. The definition and implementation of a computer programming language based on constraints. Ph.D. thesis, Dept. of Computer Science, MIT, Boston, Mass.
|
| |
42
|
SUTHERLAND, I. E. 1963. Sketchpad.: A man-machine graphical communication system. In the AFIPS Spring Joint Computer Conference. Vol. 23. AFIPS, Montvale, N.J., 329-346.
|
 |
43
|
|
| |
44
|
|
| |
45
|
|
| |
46
|
|
 |
47
|
|
 |
48
|
|
| |
49
|
WITKIN, A. AND WELCH, W. 1990. Fast animation and control of nonrigid structures. Comput. Graph. 24, 243-252.
|
CITED BY 21
|
|
Ghassan Kwaiter , Véronique Gaildrat , René Caubet, Interactive constraint system for solid modeling objects, Proceedings of the fourth ACM symposium on Solid modeling and applications, p.265-270, May 14-16, 1997, Atlanta, Georgia, United States
|
|
|
T. C. Nicholas Graham , Tore Urnes , Roy Nejabi, Efficient distributed implementation of semi-replicated synchronous groupware, Proceedings of the 9th annual ACM symposium on User interface software and technology, p.1-10, November 06-08, 1996, Seattle, Washington, United States
|
|
|
|
|
|
|
|
|
Alan Borning , Richard Anderson , Bjorn Freeman-Benson, Indigo: a local propagation algorithm for inequality constraints, Proceedings of the 9th annual ACM symposium on User interface software and technology, p.129-136, November 06-08, 1996, Seattle, Washington, United States
|
|
|
Alan Borning , Kim Marriott , Peter Stuckey , Yi Xiao, Solving linear arithmetic constraints for user interface applications, Proceedings of the 10th annual ACM symposium on User interface software and technology, p.87-96, October 14-17, 1997, Banff, Alberta, Canada
|
|
|
|
|
|
|
|
|
Alan Borning , Richard Lin , Kim Marriott, Constraints for the web, Proceedings of the fifth ACM international conference on Multimedia, p.173-182, November 09-13, 1997, Seattle, Washington, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Brad A. Myers , Richard G. McDaniel , Robert C. Miller , Alan S. Ferrency , Andrew Faulring , Bruce D. Kyle , Andrew Mickish , Alex Klimovitski , Patrick Doane, The Amulet Environment: New Models for Effective User Interface Software Development, IEEE Transactions on Software Engineering, v.23 n.6, p.347-365, June 1997
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Jaakko Järvi , Mat Marcus , Sean Parent , John Freeman , Jacob N. Smith, Property models: from incidental algorithms to reusable components, Proceedings of the 7th international conference on Generative programming and component engineering, October 19-23, 2008, Nashville, TN, USA
|
|
|
|
REVIEW
"Michael G. Murphy : Reviewer"
Simplicity, efficiency, and manageability are reasons why one-way
dataflow constraints are gaining popularity in various interactive
systems. Multiway dataflow constraints make it easy to specify certain
relationships, but predictability and e
more...
|