An intelligent backtracking schema in a logic programming environment

Creative Commons License

Cicekli I.

ACM SIGPLAN NOTICES, vol.32, no.3, pp.42-49, 1997 (SCI-Expanded) identifier identifier

  • Publication Type: Article / Article
  • Volume: 32 Issue: 3
  • Publication Date: 1997
  • Doi Number: 10.1145/251634.251639
  • Journal Indexes: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Page Numbers: pp.42-49
  • Hacettepe University Affiliated: No


We present a new method to represent variable bindings in the Warren Abstract Machine (WAM), so that the ages of variable bindings can be easily found using this new representation in our intelligent backtracking schema. The age of a variable bound to a non-variable term is the youngest choice point such that backtracking to that choice point can make that variable an unbound variable again. The procedure backtracking point is the choice point of the procedure currently being executed or the choice point of its first ancestor having a choice point. Variable ages and procedure backtracking points are used in the process of figuring out backtracking points in our intelligent backtracking schema. Our intelligent backtracking schema performs much better than the results of other intelligent backtracking methods in the literature for deterministic programs, and its performance for non-deterministic programs are comparable with their results.