摘要翻译：
在本文中，我们构造并研究了一个由命题时空逻辑的各种组合所产生的时空形式化层次，如命题时间逻辑PTL、空间逻辑RCC-8、BRCC-8、S4u及其片段。得到的结果清楚地描述了层次结构中表达性和计算可实现性之间的权衡。我们演示了不同的组合原则以及空间和时间原语如何从最多为NP或PSPACE完全的组件中产生NP,PSPACE,EXPSPACE,2EXPSPACE完全，甚至不可判定的时空逻辑。
---
英文标题：
《Combining Spatial and Temporal Logics: Expressiveness vs. Complexity》
---
作者：
D. Gabelaia, R. Kontchakov, A. Kurucz, F. Wolter, M. Zakharyaschev
---
最新提交年份：
2011
---
分类信息：

一级分类：Computer Science        计算机科学
二级分类：Artificial Intelligence        人工智能
分类描述：Covers all areas of AI except Vision, Robotics, Machine Learning, Multiagent Systems, and Computation and Language (Natural Language Processing), which have separate subject areas. In particular, includes Expert Systems, Theorem Proving (although this may overlap with Logic in Computer Science), Knowledge Representation, Planning, and Uncertainty in AI. Roughly includes material in ACM Subject Classes I.2.0, I.2.1, I.2.3, I.2.4, I.2.8, and I.2.11.
涵盖了人工智能的所有领域，除了视觉、机器人、机器学习、多智能体系统以及计算和语言（自然语言处理），这些领域有独立的学科领域。特别地，包括专家系统，定理证明（尽管这可能与计算机科学中的逻辑重叠），知识表示，规划，和人工智能中的不确定性。大致包括ACM学科类I.2.0、I.2.1、I.2.3、I.2.4、I.2.8和I.2.11中的材料。
--

---
英文摘要：
  In this paper, we construct and investigate a hierarchy of spatio-temporal formalisms that result from various combinations of propositional spatial and temporal logics such as the propositional temporal logic PTL, the spatial logics RCC-8, BRCC-8, S4u and their fragments. The obtained results give a clear picture of the trade-off between expressiveness and computational realisability within the hierarchy. We demonstrate how different combining principles as well as spatial and temporal primitives can produce NP-, PSPACE-, EXPSPACE-, 2EXPSPACE-complete, and even undecidable spatio-temporal logics out of components that are at most NP- or PSPACE-complete.
---
PDF链接：
https://arxiv.org/pdf/1110.2726