@MISC{Jonsson96rcc-5and, author = {Peter Jonsson and Thomas Drakengren}, title = {RCC-5 and its Tractable Subclasses}, year = {1996} }

Share

OpenURL

Abstract

We investigate the computational properties of the spatial algebra RCC-5 which is a restricted version of the RCC framework. The satisfiability problem for RCC-5 is known to be NP-complete but not much is known about its approximately four billion subclasses. We provide a complete classification of satisfiability for all these subclasses into polynomial and NP-complete respectively. In the process, we identify all maximal tractable subalgebras which are four in total. 1 Introduction Qualitative spatial reasoning has received a constantly increasing amount of interest in the literature. A well-known framework for qualitative spatial reasoning is the so-called RCC approach [ Randell and Cohn, 1989; Randell et al., 1992 ] . This approach is based on modelling qualitative spatial relations between regions using first-order logic. Of special interest are two subtheories of RCC, RCC-5 and RCC-8, which were first presented by Bennett [ 1994 ] . Bennett shows that it is sufficient to use pr...