Exploiting the Relationship between IA Networks and Finite Domain CSPs
André Trudel, Haiyi Zhang · 2005
We exploit the fact that qualitative interval algebra (IA) network problems are finite domain CSPs. We show how to convert a qualitative IA network into an equivalent binary CSP problem with finite integer domains. The main benefit is that standard binary CSP solution techniques can be used. Once a solution is found, the transformations can be applied in reverse to generate a solution to the original IA network. We also prove that it is not the case that all finite domain binary CSP problems have an equivalent qualitative IA network counterpart.