Constraint Programming in Constraint Nets.
Ying Zhang, Alan K. Mackworth · 1993
We view constraints as relations and constraint satisfaction as a dynamic process of approaching a stable equilibrium. We have developed an algebraic model of dynamics, called Constraint Nets, to provide a real-time programming semantics and to model and analyze dynamic systems. In this paper, we explore the relationship between constraint satisfaction and constraint nets by showing how to implement various constraint methods on constraint nets. 1 Motivation Constraints are relations among entities. Constraint satisfaction can be viewed in two different ways. First, in the logical deductive view, a constraint system is a structure hD; `i, where D is a set of constraints and ` is an entailment relation between constraints [20]. In this view, constraint satisfaction is seen as a process involving multiple agents concurrently interacting on the store-as-constraint system by checking entailment and consistency relations and refining the system monotonically. This approach is useful in da...