A Complete Classification of Tractability in RCC-5
P. Jonsson, T. Drakengren
TL;DR
This paper provides a comprehensive classification of the computational complexity of all subclasses within RCC-5, identifying four maximal tractable subalgebras and clarifying the boundary between polynomial and NP-complete cases.
Contribution
It offers the first complete classification of satisfiability complexity for all RCC-5 subclasses, including the identification of all maximal tractable subalgebras.
Findings
Four maximal tractable subalgebras identified
Complete classification of subclasses into polynomial and NP-complete
Clarifies the computational landscape of RCC-5 spatial reasoning
Abstract
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsConstraint Satisfaction and Optimization · Advanced Algebra and Logic · Logic, Reasoning, and Knowledge