Spatial Logics with Connectedness Predicates
LOGICAL METHODS IN COMPUTER SCIENCE(2010)
摘要
We consider quantifier-free spatial logics, designed for qualitative spatial representation and reasoning in AI, and extend them with the means to represent topological connectedness of regions and restrict the number of their connected components. We investigate the computational complexity of these logics and show that the connectedness constraints can increase complexity from NP to PSPACE, EXPTIME and, if component counting is allowed, to NEXPTIME.
更多查看译文
关键词
Spatial logic,topological space,connectedness,computational complexity
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络