| Y. Bekkers, B. Canet, O. Ridoux, and L. Ungaro. A memory management machine for Prolog. In Informatique--85, Symposium Sovi'eto--Fran¸cais, pages 111--117, Tallin, 1985. |
....because, CGS has no access to X, and CP 1 accesses X but is above the arc which produces the binding. It is then possible to suppress the binding at that point. This technique is named early reset in [3] The resetting of the variable and the discarding of its trail element are also described in [7]. Bruynooghe [17] describes a weaker version, called virtual backtracking, where variables are not reset to free, but where it is avoided to mark resetable binding values. The term early reset derives its name from the fact that variables, like X in the example, are reset to the free state before ....
Y. Bekkers, B. Canet, O. Ridoux, and L. Ungaro. A memory management machine for Prolog. In Informatique--85, Symposium Sovi'eto--Fran¸cais, pages 111--117, Tallin, 1985.
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