AAAI Publications, Workshops at the Twenty-Seventh AAAI Conference on Artificial Intelligence

Font Size: 
Partial Domain Search Tree For Constraint-Satisfaction Problems
Guni Sharon, Ariel Felner, Roni Stern, Nathan Sturtevant

Last modified: 2013-06-29


CSP solvers usually search a partial assignment search tree.We present a new formalization for CSP solvers, which spansa conceptually different search tree, where each node representssubsets of the original domains for the variables. We experimentwith a simple backtracking algorithm for this searchtree and show that it outperforms a simple backtracking algorithmon the traditional search tree in many cases.



Full Text: PDF