Interval Temporal Logics Over Finite Linear Orders: The Complete Picture
ECAI'12: Proceedings of the 20th European Conference on Artificial Intelligence(2012)
摘要
Interval temporal logics provide a natural framework for temporal reasoning about interval structures over linearly ordered domains, where intervals are taken as the primitive ontological entities. In this paper, we identify all fragments of Halpern and Shoham's interval temporal logic HS whose finite satisfiability problem is decidable. We classify them in terms of both relative expressive power and complexity. We show that there are exactly 62 expressively-different decidable fragments, whose complexity ranges from NP-complete to non-primitive recursive ( all other HS fragments have been already shown to be undecidable).
更多查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络