| Georg Ringwelski. Search in asynchronous constraint solving. In CP'02 Doctoral Programme, 2002. http://www.math.unipd.it/~frossi/ringwelski.ps. |
....techniques for search and are applicable to solve DynCSPs. These solvers provide a reverse operation to constraint posting, called constraint retraction [22, 10, 7] With this operation arbitrary non deterministic search algorithms can be implemented that post and retract instantiation constraints [21, 17]. The search algorithm posts instantiations to explore the search space and retracts them, if in inconsistency occurred due to their propagation. The retraction algorithm provided by every constraint c computes a state, that would be the current state, if c would not have been posted in the past. ....
Georg Ringwelski. Search in asynchronous constraint solving. In CP'02 Doctoral Programme, 2002. http://www.math.unipd.it/~frossi/ringwelski.ps.
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