DocumentCode
424205
Title
A reasoning method for resolving spatial constraint satisfactory problem
Author
Guo, Ping ; Tao, Huang-Fu ; Luo, Ya
Author_Institution
Sch. of Comput. Sci., Chongqing Univ., China
Volume
4
fYear
2004
fDate
26-29 Aug. 2004
Firstpage
2262
Abstract
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.
Keywords
common-sense reasoning; constraint theory; spatial reasoning; constraint satisfactory problem; hierarchy-based method; qualitative spatial reasoning; resolving spatial objects layout; spatial topological relations; Artificial intelligence; Cognition; Computer science; Electronic mail; Extraterrestrial measurements; Inference algorithms; Motion analysis; Shape; Solid modeling; Spatial resolution;
fLanguage
English
Publisher
ieee
Conference_Titel
Machine Learning and Cybernetics, 2004. Proceedings of 2004 International Conference on
Print_ISBN
0-7803-8403-2
Type
conf
DOI
10.1109/ICMLC.2004.1382176
Filename
1382176
Link To Document