TY - GEN
T1 - Partial domain search tree for constraint-satisfaction problems
AU - Sharon, Guni
AU - Felner, Ariel
AU - Stern, Roni
AU - Sturtevant, Nathan
PY - 2013
Y1 - 2013
N2 - CSP solvers usually search a partial assignment search tree. We present a new formalization for CSP solvers, which spans a conceptually different search tree, where each node represents subsets of the original domains for the variables. We experiment with a simple backtracking algorithm for this search tree and show that it outperforms a simple backtracking algorithm on the traditional search tree in many cases.
AB - CSP solvers usually search a partial assignment search tree. We present a new formalization for CSP solvers, which spans a conceptually different search tree, where each node represents subsets of the original domains for the variables. We experiment with a simple backtracking algorithm for this search tree and show that it outperforms a simple backtracking algorithm on the traditional search tree in many cases.
UR - http://www.scopus.com/inward/record.url?scp=84898848732&partnerID=8YFLogxK
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:84898848732
SN - 9781577356288
T3 - AAAI Workshop - Technical Report
SP - 125
EP - 127
BT - Late-Breaking Developments in the Field of Artificial Intelligence - Papers Presented at the 27th AAAI Conference on Artificial Intelligence, Technical Report
PB - AI Access Foundation
T2 - 27th AAAI Conference on Artificial Intelligence, AAAI 2013
Y2 - 14 July 2013 through 18 July 2013
ER -