Backtracking without Trailing in CLP(RLin)

@inproceedings{Hentenryck1994BacktrackingWT,
  title={Backtracking without Trailing in CLP(RLin)},
  author={Pascal Van Hentenryck and Viswanath Ramachandran},
  booktitle={PLDI},
  year={1994}
}
Constraint logic programming (CLP) is a generalization of logicprogramming where unification is replaced by constraint solving as thebasic operation of the language. The combination of constraint solvingand nondeterminism (approximated by backtracking) makes these languagesappealing for a variety of combinatorial search problems. Existing CLPlanguages support backtracking by generalizing traditional Prologimplementations: modifications to the constraint system are trailed andrestored on… CONTINUE READING