A Complete Classification of Tractability in RCC-5
1997 ◽
Vol 6
◽
pp. 211-221
◽
Keyword(s):
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 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.
1999 ◽
Vol 11
◽
pp. 361-390
◽
2018 ◽
Vol 10
(1)
◽
pp. 67-78
◽
2017 ◽
Vol 16
(10)
◽
pp. 1750197
◽
2016 ◽
Vol 31
(17)
◽
pp. 1650102
◽
2003 ◽
Vol 35
(6)
◽
pp. 1059-1076
◽
Keyword(s):