Backtracking without trailing in CLP (<inline-equation> <f> <ge>R</ge><inf>Lin</inf></f> </inline-equation>)


Existing CLP languages support backtracking by generalizing traditional Prolog implementations: modifications to the constraint system are trailed and restored on backtracking. Although simple and efficient, trailing may be very demanding in memory space, since the constraint system may potentially be saved at each choice point. This article proposes a new… (More)
DOI: 10.1145/210184.210192


6 Figures and Tables