【24h】

On the Computational Complexity of Spatio-Temporal Logics

机译:时空逻辑的计算复杂性

获取原文
获取原文并翻译 | 示例

摘要

Recently, a hierarchy of spatio-temporal languages based on the prepositional temporal logic PTL and the spatial languages RCC-8, BRCC-8 and S4_u has been introduced. Although a number of results on their computational properties were obtained, the most important questions were left open. In this paper, we solve these problems and provide a clear picture of the balance between expressiveness and 'computational realisability' within the hierarchy.
机译:最近,已经引入了基于介词时态逻辑PTL和空间语言RCC-8,BRCC-8和S4_u的时空语言层次结构。尽管获得了有关其计算属性的许多结果,但最重要的问题仍然悬而未决。在本文中,我们解决了这些问题,并提供了层次结构内表达能力与“计算可实现性”之间平衡的清晰画面。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号