Work

Non-binary conditional constraint satisfaction problems solution

Year: 2014
Type: article
Abstract: Non-binary Conditional Constraint Satisfaction Problem(NCCSP)is an extension of Binary Conditional Constraint Satisfaction Problem(BCCSP).A NCCSP-model was proposed.According to the change of variable statuses caused by activity constraints,the tactics of look backward and look forward combining with different levels of non-binary arc consistency technology were adopted to propose a non-binary conditional backtracking algorithm and two non-binary conditional forward checking algorithms,which could effectively deal with non-binary constraints and variability of variable status in NCCSP.The time complexities of three algorithms in worst cases were analyzed, and the performances of three algorithms were compared by the experiments on random problems.Experimental results demonstrated that the performances of two non-binary conditional forward checking algorithms were evidently better than that of non-binary conditional backtracking algorithm in hard problems,while there was distinct difference between the performances of the two non-binary conditional forward checking algorithms in the case of low dynamical medium-size problems and high dynamical large-size problems.
Author: Yuan Ji-ju
Language: English
Open Access status: diamond
OpenAlex ID: W2379747213
FWCI:
Cites:
Cited by:
Related to: 10