RCC8 binary constraint network can be consistently extended
- Publication Type:
- Journal Article
- Citation:
- Artificial Intelligence, 2006, 170 (1), pp. 1 - 18
- Issue Date:
- 2006-01-01
Closed Access
| Filename | Description | Size | |||
|---|---|---|---|---|---|
 | 2007004950OK.pdf | 218.4 kB |
Copyright Clearance Process
- Recently Added
- In Progress
- Closed Access
This item is closed access and not available.
The RCC8 constraint language developed by Randell et al. has been popularly adopted by the Qualitative Spatial Reasoning and GIS communities. The recent observation that RCC8 composition table describes only weak composition instead of composition raises questions about Renz and Nebel's maximality results about the computational complexity of reasoning with RCC8. This paper shows that any consistent RCC8 binary constraint network (RCC8 network for short) can be consistently extended. Given Θ, an RCC8 network, and z, a fresh variable, suppose xTy∈Θ and T is contained in the weak composition of R and S. This means that we can add two new constraints xRz and zSy to Θ without changing the consistency of the network. The result guarantees the applicability to RCC8 of one key technique, (Theorem 5) of [J. Renz, B. Nebel, On the complexity of qualitative spatial reasoning: A maximal tractable fragment of the Region Connection Calculus. Artificial Intelligence 108 (1999) 69-123], which allows the transfer of tractability of a set of RCC8 relations to its closure under composition, intersection, and converse. © 2005 Elsevier B.V. All rights reserved.
Please use this identifier to cite or link to this item: