{"type":"ScholarlyArticle","title":"On the Complexity of Qualitative Spatial Reasoning: A Maximal Tractable Fragment of the Region Connection Calculus","authors":[{"name":"Jochen Renz","slug":"jochen-renz","given":"Jochen","family":"Renz","affiliation":""},{"name":"Bernhard Nebel","slug":"bernhard-nebel","given":"Bernhard","family":"Nebel","affiliation":""}],"abstract":"The computational properties of qualitative spatial reasoning have been investigated to some degree. However, the question for the boundary between polynomial and NP-hard reasoning problems has not been addressed yet. In this paper we explore this boundary in the \"Region Connection Calculus\" RCC-8. We extend Bennett's encoding of RCC-8 in modal logic. Based on this encoding, we prove that reasoning is NP-complete in general and identify a maximal tractable subset of the relations in RCC-8 that contains all base relations. Further, we show that for this subset path-consistency is sufficient for deciding consistency.","doi":null,"url":"https://ijcai.org/proceedings/1997/77","pdf":"https://ijcai.org/proceedings/1997/0077.pdf","markdown":"https://ijcai.org/proceedings/1997/77.md","bibtex":"https://ijcai.org/proceedings/1997/bibtex/77","volume":{"slug":"1997","title":"Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 1997","url":"https://ijcai.org/proceedings/1997/","year":1997,"location":"Nagoya, Japan","dates":"","editors":"Martha E. Pollack","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":"Diagnosis and Qualitative Reasoning","track":"Diagnosis and Qualitative Reasoning","number":77,"pages":{"first":522,"last":526},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}