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
M. Stollberg, M. Hepp, und J. Hoffmann. Proceedings of the 6th International Semantic Web Conference and 2nd Asian Semantic Web Conference (ISWC/ASWC2007), Busan, South Korea, Volume 4825 von LNCS, Seite 477--490. Berlin, Heidelberg, Springer Verlag, (November 2007)
C. Elsenbroich, O. Kutz, und U. Sattler. Proceedings of the OWLED*06 Workshop on OWL: Experiences and Directions, Volume 216 von CEUR-WS.org, (November 2006)
J. Pemberton, und F. Galiber. Constraint Programming and Large Scale Discrete Optimization, Volume 57 von DIMACS Series in Discrete Mathematics and Theoretical Computer Science, E.C. Freuder, R.J.Wallace (editors), (1998)