DMCA
The Complexity of Reasoning about Spatial Congruence (1999)
Cached
Download Links
- [www.cs.cmu.edu]
- [www.cs.cmu.edu]
- [www.jair.org]
- [jair.org]
- [arxiv.org]
- DBLP
Other Repositories/Bibliography
| Venue: | Journal of Artificial Intelligence Research |
| Citations: | 14 - 3 self |
BibTeX
@ARTICLE{Cristani99thecomplexity,
author = {Matteo Cristani},
title = {The Complexity of Reasoning about Spatial Congruence},
journal = {Journal of Artificial Intelligence Research},
year = {1999},
volume = {11},
pages = {361--390}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
In the recent literature of Artificial Intelligence, an intensive research effort has been spent, for various algebras of qualitative relations used in the representation of temporal and spatial knowledge, on the problem of classifying the computational complexity of reasoning problems for subsets of algebras. The main purpose of these researches is to describe a restricted set of maximal tractable subalgebras, ideally in an exhaustive fashion with respect to the hosting algebras. In this paper we introduce a novel algebra for reasoning about Spatial Congruence, show that the satisfiability problem in the spatial algebra MC-4 is NP-complete, and present a complete classification of tractability in the algebra, based on the individuation of three maximal tractable subclasses, one containing the basic relations. The three algebras are formed by 14, 10 and 9 relations out of 16 which form the full algebra. 1. Introduction Qualitative spatial reasoning has received an increasin...
Keyphrases
spatial congruence hosting algebra computational complexity recent literature full algebra main purpose exhaustive fashion basic relation complete classification introduction qualitative spatial reasoning spatial knowledge novel algebra satisfiability problem spatial algebra mc-4 qualitative relation various algebra intensive research effort restricted set maximal tractable subalgebras artificial intelligence maximal tractable subclass
