DocumentCode :
3515550
Title :
Associated Constraint Based Non-Binary Arc Consistency for Non-Binary CSP
Author :
Wang Kexi ; Yuan Jijun ; Shan Miyuan
Author_Institution :
Manage. Sch., Hunan Univ., Changsha
fYear :
2007
fDate :
21-25 Sept. 2007
Firstpage :
6679
Lastpage :
6683
Abstract :
Arc consistency has been successfully applied to binary constraint satisfaction problem but cannot be generalized to effectively preprocess non-binary constraint satisfaction problem (NCSP). Associated constraint based non-binary arc consistency (nACBA) for preprocessing NCSP was proposed in this paper. Some NCSP instances generated by random NCSP generator were first preprocessed by nACBA and non-binary arc- consistency (nAC) respectively, and then solved by backtracking algorithm. Performances of backtracking, nACBA based backtracking and nAC based backtracking were evaluated and compared. The experimental results indicate that nACBA based backtracking is even more robust than the other two algorithms, which means associated constraint based non-binary arc-consistency can more effectively eliminate inconsistent values from the domains of variables or redundant constraint tuples from constraints than non-binary arc consistency.
Keywords :
constraint theory; operations research; associated constraint; backtracking algorithm; nonbinary arc consistency; nonbinary constraint satisfaction problem; redundant constraint; Artificial intelligence; Constraint theory; Educational programs; Humans; NP-hard problem; Performance evaluation; Robustness;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Wireless Communications, Networking and Mobile Computing, 2007. WiCom 2007. International Conference on
Conference_Location :
Shanghai
Print_ISBN :
978-1-4244-1311-9
Type :
conf
DOI :
10.1109/WICOM.2007.1639
Filename :
4341414
Link To Document :
بازگشت