A reasoning method for resolving spatial constraint satisfactory problem

Constraint satisfactory problem (CSP) is a general model for resolving spatial objects layout, and it is one of primary problems for researches of qualitative spatial reasoning of spatial topological relations. First, hierarchy-based method (HBM) is introduced. Then, based on HBM, combinative tables are present. Third, an algorithm for resolving CSP of spatial topological relations based on hierarchy is presented, and correctness of this algorithm is proved. Last, an example model is applied to certify this algorithm.