RCC8 is polynomial on networks of bounded treewidth

Authors:
Manuel Bodirsky;Stefan Wölfl
Affiliations:
Laboratoire d'Informatique, LIX, CNRS, UMR, École Polytechnique, France;Department of Computer Science, University of Freiburg, Germany
Venue:
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
Year:
2011

Citing 15
Cited 2

A shorter model theory

A shorter model theory
Boolean connection algebras: a new approach to the Region-Connection Calculus

Artificial Intelligence
Determining Consistency of Topological Relations

Constraints
Towards Cognitive Adequacy of Topological Spatial Relations

Spatial Cognition II, Integrating Abstract Theories, Empirical Studies, Formal Methods, and Practical Applications
Reasoning about Binary Topological Relations

SSD '91 Proceedings of the Second International Symposium on Advances in Spatial Databases
Computing Transivity Tables: A Challenge For Automated Theorem Provers

CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction
Extensionality of the RCC8 composition table

Fundamenta Informaticae
Qualitative Spatial Representation and Reasoning: An Overview

Fundamenta Informaticae - Qualitative Spatial Reasoning
Combining binary constraint networks in qualitative reasoning

Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
Constraint satisfaction with bounded treewidth revisited

Journal of Computer and System Sciences
A divide-and-conquer approach for solving interval algebra networks

IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Cross-cultural similarities in topological reasoning

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

Qualitative spatial reasoning with topological information
Datalog and constraint satisfaction with infinite templates

STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
On the power of k-consistency

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

Extension properties of boolean contact algebras

RAMiCS'12 Proceedings of the 13th international conference on Relational and Algebraic Methods in Computer Science
Decomposition and tractability in qualitative spatial and temporal reasoning

Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

We construct an homogeneous (and ω-categorical) representation of the relation algebra RCC8, which is one of the fundamental formalisms for spatial reasoning. As a consequence we obtain that the network consistency problem for RCC8 can be solved in polynomial time for networks of bounded treewidth.