A Complete Classification of Tractability in RCC-5
P. Jonsson, T. Drakengren
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.
Create a lesson
Related papers
Co-Evolving Acting and Forecasting for Language Agents
Haofei Yu, Yixing Chen, Yining Zhao et al.
Scaling Discovery Requires Forgetting
Shangyin Tan, Ben Zhou, Lakshya A Agrawal et al.
PhySGA: A Physics-Space Grounded Agentic Framework for Generalizable and Interactive 3D Composition
Weichen Lyu, Chong Xia, Mingyu Dong et al.
ActiveEvidence: Decision-Focused Evidence Graphs with Verifiable Acquisition Gaps
Miaobo Hu, Shuhao Hu, Xiaobo Guo et al.
The Wealth of Agents: Scaling Agentic AI Across Developers
Austin W. Hanjie, Carlos E. Jimenez, Zirui Wang et al.
SafeAdapt-Poker: Counterfactual Risk Calibration for Budgeted Adaptation under Opponent Shift
Miaobo Hu, Shuhao Hu, Xiaobo Guo et al.