A methodology for managing hard constraints in CLP systems
Joxan Jaffar, Spiro Michaylov, Roland H. C. Yap · 1991
In constraint logic programming (CLP) systems, the standard technique for dealing with hard constraints is to delay solving them until additional constraints reduce them to a simpler form.For example, the CLP (7?) system delays the solving of nonlinear equations until they become linear, when certain variables become ground.In a naive implement ation, the overhead of delaying and awakening constraints could render a CLP system impractical.