Necessary conditions for tractability of valued CSPs.

Johan Thapper Stanislav Zivný

Published in: CoRR (2015)

Keyphrases

constraint satisfaction
constraint satisfaction problems
constraint problems
np complete
data sets
computational complexity
sufficient conditions
neural network
search space
constraint propagation
non binary
genetic algorithm
evolutionary algorithm
environmental conditions
backtracking algorithm
valued logic