On the Computational Complexity of Spatial Logics with Connectedness Constraints.
Roman KontchakovIan Pratt-HartmannFrank WolterMichael ZakharyaschevPublished in: LPAR (2008)
Keyphrases
- computational complexity
- spatial constraints
- spatial information
- np complete
- computationally efficient
- expressive power
- temporal continuity
- constraint programming
- constraint satisfaction
- spatial data
- computational cost
- special case
- spatio temporal
- bit rate
- worst case
- low complexity
- memory requirements
- spatial databases
- spatial relations
- constrained optimization
- spatial distribution
- storage requirements
- search space
- spatial features
- interval algebra
- genetic algorithm