{"type":"ScholarlyArticle","title":"Maximal Tractable Fragments of the Region Connection Calculus: A Complete Analysis","authors":[{"name":"Jochen Renz","slug":"jochen-renz","given":"Jochen","family":"Renz","affiliation":""}],"abstract":"We present a general method for proving tractabi lity of reasoning over disjunctions of jointly exhau st ive a nd pairwise disjoint relations. Examples of these kinds of relations are Allen's temporal interval relations and their spatial counterpart, the RCC8 relations by Randell , Cui, and Cohn. Applying this method does not require d eta il ed knowledge a bout the considered relations; instead, it is rather sufficient to have a subset of the considered set of relations for which path-consistency is known to decide consistency. Using this m et hod , we give a complete class ifi cation of tractability of reasoning over RCC8 by identifying two large n ew maximal tractabl e subsets ~ nd show that these two subsets together with 1{8 , the already known maximal tractabl e subset, are the only such sets for RCC8 that conta in all base relations. We also apply our method to Allen's interval algebra and derive the known maximal tractable subset.","doi":null,"url":"https://ijcai.org/proceedings/1999/65","pdf":"https://ijcai.org/proceedings/1999/0065.pdf","markdown":"https://ijcai.org/proceedings/1999/65.md","bibtex":"https://ijcai.org/proceedings/1999/bibtex/65","volume":{"slug":"1999","title":"Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 1999","url":"https://ijcai.org/proceedings/1999/","year":1999,"location":"Stockholm, Sweden","dates":"","editors":"Thomas Dean","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":"Constraint Satisfaction","track":"Constraint Satisfaction","number":65,"pages":{"first":448,"last":454},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}