MAC-DBT Revisited. Conference Paper uri icon


  • Abstract. Dynamic Backtracking (DBT) is a well known algorithm for solving Constraint Satisfaction Problems. In DBT, variables are allowed to keep their assignment during backjump, if they are compatible with the set of eliminating explanations. A previous study has shown that when DBT is combined with variable ordering heuristics, it performs poorly compared to standard Conflictdirected Backjumping (CBJ)[Bak94]. In later studies, DBT was enhanced with constraint propagation methods. The MAC-DBT algorithm was reported by …

publication date

  • June 15, 2009

presented at event