loading...
About the use of local consistency in solving CSPs
Vancouver, British Columbia, Canada November 13-November 15
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TAI.2000.88985312th IEEE International Conference on ...
 This Article 
 
Buy PURCHASE ARTICLE: $19
PDF
HTML
Buy IEEE Xplore Subscribers
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
ASCII Text
x 
 
A. Chmeiss, L. Sais, "About the use of local consistency in solving CSPs," Tools with Artificial Intelligence, IEEE International Conference on, pp. 0104, 12th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'00), 2000.
 
 
BibTex
x
 
@article{ 10.1109/TAI.2000.889853,
author = {A. Chmeiss and L. Sais},
title = {About the use of local consistency in solving CSPs},
journal ={Tools with Artificial Intelligence, IEEE International Conference on},
volume = {0},
year = {2000},
isbn = {0-7695-0909-6},
pages = {0104},
doi = {http://doi.ieeecomputersociety.org/10.1109/TAI.2000.889853},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Tools with Artificial Intelligence, IEEE International Conference on
TI - About the use of local consistency in solving CSPs
SN - 0-7695-0909-6
SP
EP
A1 - A. Chmeiss,
A1 - L. Sais,
PY - 2000
KW - constraint handling; problem solving; search problems; local consistency; constraint satisfaction problem solving; search algorithms; filtering techniques; path consistency; singleton arc consistency; pruning
VL - 0
JA - Tools with Artificial Intelligence, IEEE International Conference on
ER -
 
A. Chmeiss, Univ. d'Artois, Lens, France
L. Sais, Univ. d'Artois, Lens, France
Abstract: Local consistency is often a suitable paradigm for solving constraint satisfaction problems. We show how search algorithms could be improved, thanks to a smart use of two filtering techniques (path consistency and singleton arc consistency). We propose a possible way to get benefits from using a partial form of path consistency (PC) during the search. We show how local treatment based on singleton arc consistency (SAC) can be used to achieve more powerful pruning.
Index Terms:
constraint handling; problem solving; search problems; local consistency; constraint satisfaction problem solving; search algorithms; filtering techniques; path consistency; singleton arc consistency; pruning
Citation:
A. Chmeiss, L. Sais, "About the use of local consistency in solving CSPs," ictai, pp.0104, 12th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'00), 2000
Usage of this product signifies your acceptance of the Terms of Use.