@inproceedings{af1b3b80190449b68da16d3db2eba050,
title = "Partial domain search tree for constraint-satisfaction problems",
abstract = "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.",
author = "Guni Sharon and Ariel Felner and Roni Stern and Nathan Sturtevant",
year = "2013",
month = jan,
day = "1",
language = "الإنجليزيّة",
isbn = "9781577356288",
series = "AAAI Workshop - Technical Report",
publisher = "AI Access Foundation",
pages = "125--127",
booktitle = "Late-Breaking Developments in the Field of Artificial Intelligence - Papers Presented at the 27th AAAI Conference on Artificial Intelligence, Technical Report",
address = "الولايات المتّحدة",
note = "27th AAAI Conference on Artificial Intelligence, AAAI 2013 ; Conference date: 14-07-2013 Through 18-07-2013",
}