An Incremental Algorithm for Satisfying Hierarchies of Multi-way, Dataflow Constraints

An Incremental Algorithm for Satisfying Hierarchies of Multi-way, Dataflow Constraints (1995)

Cached

Download Links

by Brad Vander Zanden

Venue:	ACM Transactions on Programming Languages and Systems
Citations:	44 - 1 self

Versions

Version History

Metadata Version 3

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	An Incremental Algorithm for Satisfying Hierarchies of Multi-way, Dataflow Constraints	user correction - Legacy Corrections
AUTHOR NAME	Brad Vander Zanden	SVM HeaderParse 0.1
AUTHOR AFFIL	Computer Science Department; University of Tennessee	SVM HeaderParse 0.2
AUTHOR ADDR	Knoxville, TN 37996	SVM HeaderParse 0.1
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 multi-way dataflow constraints 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 algorithms for satisfying constraint hierarchies encounter two difficulties: (1) they are incapable of guaranteeing an acyclic solution if a constraint hierarchy has one or more cyclic solutions, and (2) they require worst-case exponential time to satisfy systems of multi-output constraints. This paper surmounts these difficulties by presenting an 2 incremental algorithm called QuickPlan that satisfies in worst case O(N ) ...	user correction - Legacy Corrections
YEAR	1995	user correction - Legacy Corrections
VENUE	ACM Transactions on Programming Languages and Systems	INFERENCE
VENUE TYPE	JOURNAL	INFERENCE
PAGES	30--72	INFERENCE
VOLUME	18	INFERENCE
TECH	Tech. Report	INFERENCE
CITATIONS	52 found	ParsCit 1.0