DocumentCode :
3255659
Title :
Reduction of constraint networks based on local consistency
Author :
Yuan, Li An ; Farrag, Abdel Aziz
Author_Institution :
Dept. of Maths. & Comput. Sci., Dalhousie Univ., Halifax, NS, Canada
fYear :
1992
fDate :
28-30 May 1992
Firstpage :
282
Lastpage :
285
Abstract :
The paper proposes a new approach to reduce a constraint network so that a backtrack-free search may be used, based on local consistency. It shows that this approach can be used to solve efficiently a large class of the constraint satisfaction problem
Keywords :
artificial intelligence; constraint theory; search problems; trees (mathematics); backtrack-free search; constraint networks; constraint satisfaction problem; local consistency; Computer networks; Constraint theory; Electronic mail; Mathematics; Niobium compounds; Polynomials; Terminology; Tree graphs;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computing and Information, 1992. Proceedings. ICCI '92., Fourth International Conference on
Conference_Location :
Toronto, Ont.
Print_ISBN :
0-8186-2812-X
Type :
conf
DOI :
10.1109/ICCI.1992.227654
Filename :
227654
Link To Document :
بازگشت