Exploiting the Relationship between IA Networks and Finite Domain CSPs

We exploit the fact that qualitative Interval Algebra (IA) network problems are finite domain CSPs. In the first part of the paper, 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. In the second part of the paper, we present an IA network implementation based on finite domain non-binary CSPs. The implementation has a GUI which permits the drawing of arbitrary IA networks. The goal of the implementation is simplicity and ease of use.

• Type: Conference
• Year: 2005
• Where: TIME
• Authors: André Trudel, Haiyi Zhang
• Keywords: Binary Csp, Ia Networks, Logical Reasoning, Qualitative Ia Network, TIME 2005