We investigate the computational properties of the spatial algebra RCC-5 which is a restricted version of the RCC framework for spatial reasoning. The sati...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
to reasoning spatial-algebra taxonomy 4dave logic by ludaesch on Jan 6, 2007, 5:15 AM
