We investigate the computational properties of the spatial algebra RCC-5 which is a restricted version of the RCC framework for spatial reasoning. The satisfiability problem for RCC-5 is known to be NP-complete but not much is known about its approximatel
S. Kuznetsov, S. Obiedkov, и C. Roth. Proceedings of the 15th International Conference on Conceptual Structures (ICCS 2007), том 4604 из Lecture Notes in Artificial Intelligence, стр. 241-254. Berlin, Heidelberg, Springer-Verlag, (июля 2007)
S. Kuznetsov, S. Obiedkov, и C. Roth. Proceedings of the 15th International Conference on Conceptual Structures (ICCS 2007), том 4604 из Lecture Notes in Artificial Intelligence, стр. 241-254. Berlin, Heidelberg, Springer-Verlag, (июля 2007)