Direction Relations Reasoning Based on Constraint Satisfaction Problems

Constraint Satisfaction Problems (for short CSP) is one of the fields Artificial Intelligence is researching in, Such as Machine Vision, Space Scheduling, Relations Reasoning and other many problems of computer science are regarded as the certain example of CSP. Direction Relations are the important parts of Spatial Relations, which are used to describe the orientations of an object with other objects. This paper proposed a new idea based on the Back Jumping Algorithm in CSP, and applied it to Direction Relations Reasoning. Practice has proved that the algorithm is effective.