A complete classification of tractability in RCC-5

Authors:
Peter Jonsson;Thomas Drakengren
Affiliations:
Department of Computer and Information Science, Linköping University, Linköping, Sweden;Department of Computer and Information Science, Linköping University, Linköping, Sweden
Venue:
Journal of Artificial Intelligence Research
Year:
1997

Citing 9
Cited 25

Computer algorithms: introduction to design and analysis (2nd ed.)

Computer algorithms: introduction to design and analysis (2nd ed.)
Modelling topological and metrical properties in physical processes

Proceedings of the first international conference on Principles of knowledge representation and reasoning
Reasoning about qualitative temporal information

Artificial Intelligence - Special volume on constraint-based reasoning
Reasoning about temporal relations: a maximal tractable subclass of Allen's interval algebra

Journal of the ACM (JACM)
Reasoning about Binary Topological Relations

SSD '91 Proceedings of the Second International Symposium on Advances in Spatial Databases
Computational Properties of Qualitative Spatial Reasoning: First Results

KI '95 Proceedings of the 19th Annual German Conference on Artificial Intelligence: Advances in Artificial Intelligence
The complexity of theorem-proving procedures

STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Topological inference

IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Maximal tractable subclasses of Allen's interval algebra: preliminary report

AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1

Combining topological and size information for spatial reasoning

Artificial Intelligence
Disjunctions, independence, refinements

Artificial Intelligence
Refinements and Independence: A Simple Method for Identifying Tractable Disjunctive Constraints

CP '02 Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming
Reasoning about temporal relations: The tractable subalgebras of Allen's interval algebra

Journal of the ACM (JACM)
The complexity of constraint satisfaction problems for small relation algebras

Artificial Intelligence
Relation Algebras and their Application in Temporal and Spatial Reasoning

Artificial Intelligence Review
On the consistency of cardinal direction constraints

Artificial Intelligence
Qualitative Spatial Representation and Reasoning: An Overview

Fundamenta Informaticae - Qualitative Spatial Reasoning
Merging taxonomies under RCC-5 algebraic articulations

Proceedings of the 2nd international workshop on Ontologies and information systems for the semantic web
Constraint Satisfaction Problems with Infinite Templates

Complexity of Constraints
Maximal infinite-valued constraint languages

Theoretical Computer Science
Towards a complete classification of tractability in Allen's algebra

IJCAI'97 Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2
Eight maximal tractable subclasses of Allen's algebra with metric time

Journal of Artificial Intelligence Research
On the consistency of cardinal direction constraints

Artificial Intelligence
Peek arc consistency

Theoretical Computer Science
The complexity of temporal constraint satisfaction problems

Journal of the ACM (JACM)
Merging qualitative constraint networks defined on different qualitative formalisms

COSIT'09 Proceedings of the 9th international conference on Spatial information theory
Qualitative spatial reasoning with topological information

Qualitative spatial reasoning with topological information
A semi-dynamical approach for solving qualitative spatial constraint satisfaction problems

Theoretical Computer Science
Extended CDC vs other formalisms --- the comperative analysis of the models for spatio-temporal reasoning

ICAISC'12 Proceedings of the 11th international conference on Artificial Intelligence and Soft Computing - Volume Part II
Qualitative Spatial Representation and Reasoning: An Overview

Fundamenta Informaticae - Qualitative Spatial Reasoning
Relations algebras in qualitative spatial reasoning

Fundamenta Informaticae
Qualitative temporal and spatial reasoning revisited

CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
Maximal infinite-valued constraint languages

ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Tractable set constraints

Journal of Artificial Intelligence Research

Quantified Score

Hi-index	0.02

Visualization

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.