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, and C. Roth. Proceedings of the 15th International Conference on Conceptual Structures (ICCS 2007), volume 4604 of Lecture Notes in Artificial Intelligence, page 241-254. Berlin, Heidelberg, Springer-Verlag, (July 2007)
S. Kuznetsov, S. Obiedkov, and C. Roth. Proceedings of the 15th International Conference on Conceptual Structures (ICCS 2007), volume 4604 of Lecture Notes in Artificial Intelligence, page 241-254. Berlin, Heidelberg, Springer-Verlag, (July 2007)