M. Wilson and A. Borning. Hierarchical constraint logic programing. Tech. rep., University of Washington, May 1993. Home/Search Document Not in Database Summary Related Articles |
This paper is cited in the following contexts:
Houria III: A Solver For Hierarchical Systems Of.. - Bouzoubaa, Neveu, Hasle (Correct)
....be determined by at most one constraint, i.e. the graph must have no conflicts) and all the constraints must be partially ordered (i.e. the graph must have no cycles) Applying local propagation to solution graph is, in short, equivalent to solving necessary constraints in a topological order. In [4, 5], Borning et al. proposed constraint hierarchies to cope with the problem of over constrained systems. A constraint hierarchy is a system of constraints with hierarchical strengths. If the system is over constrained, it is solved so that there are as many satisfied strong constraints as possible. ....
M. Wilson and A. Borning. Hierarchical constraint logic programing. Tech. rep., University of Washington, May 1993.
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