An improved data-dependency-based backtracking scheme for Prolog (Q1823727)

The article describes modification of data dependency based backtracking scheme for Prolog. Its idea stems from observation that data dependent backtracking scheme used in another approaches is not sufficiently selective. It argues that it is not necessary to include as backtrack points all so called contributing goals. In this respect the article is interesting modification of \textit{V. Kumar}, \textit{Y. J. Lin} [J. Logic Program. 5, No.2, 165-181 (1988; Zbl 0645.68102)]. Concerning the implementation in WAM the presentation is not precise enough to show what modifications are necessary. It is clear that introduction of tags will double memory needed for every variable. Moreover, the implementation of \(``>''\) relationship requires to add some kind of time tags. It would lead to considerable overhead both in memory and time.