Partial domain search tree for constraint-satisfaction problems

Guni Sharon, Ariel Felner, Roni Stern, Nathan Sturtevant

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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.

Original languageEnglish
Title of host publicationLate-Breaking Developments in the Field of Artificial Intelligence - Papers Presented at the 27th AAAI Conference on Artificial Intelligence, Technical Report
PublisherAI Access Foundation
Pages125-127
Number of pages3
ISBN (Print)9781577356288
StatePublished - 1 Jan 2013
Event27th AAAI Conference on Artificial Intelligence, AAAI 2013 - Bellevue, WA, United States
Duration: 14 Jul 201318 Jul 2013

Publication series

NameAAAI Workshop - Technical Report
VolumeWS-13-17

Conference

Conference27th AAAI Conference on Artificial Intelligence, AAAI 2013
Country/TerritoryUnited States
CityBellevue, WA
Period14/07/1318/07/13

ASJC Scopus subject areas

  • Engineering (all)

Fingerprint

Dive into the research topics of 'Partial domain search tree for constraint-satisfaction problems'. Together they form a unique fingerprint.

Cite this