Title :
DeltaStar: a general algorithm for incremental satisfaction of constraint hierarchies
Author :
Freeman-Benson, Bjorn ; Wilson, Molly ; Borning, Alan
Author_Institution :
Dept. of Comput. Sci., Victoria Univ., BC, Canada
Abstract :
The DeltaStar incremental algorithm for solving constraint hierarchies, which was developed as part of a continuing investigation on the design and implementation of constraint programming languages, is described. DeltaStar is a framework for incremental solvers built above an existing flat solver that provides the constraint solving techniques. By plugging different flat solvers into DeltaStar, different hierarchical solvers can quickly be produced and experimented with. Two implementations of DeltaStar, as well as previous algorithms that can be viewed as instances of DeltaStar, are discussed.<>
Keywords :
constraint handling; object-oriented programming; parallel algorithms; DeltaStar; constraint hierarchies; design; general algorithm; hierarchical solvers; implementation; incremental satisfaction; incremental solvers; programming languages; Algorithm design and analysis; Computer languages; Computer science; Equations; Graphics; Iterative algorithms; Logic programming; Object oriented programming; Tin; USA Councils;
Conference_Titel :
Computers and Communications, 1992. Conference Proceedings., Eleventh Annual International Phoenix Conference on
Conference_Location :
Scottsdale, AZ, USA
Print_ISBN :
0-7803-0605-8
DOI :
10.1109/PCCC.1992.200605
