Decidability of a Hybrid Duration Calculus-Reference-Cited by-同舟云学术

Decidability of a Hybrid Duration Calculus

Published:2007-06 Issue:6 Volume:174 Page:113-133
ISSN:1571-0661
Container-title:Electronic Notes in Theoretical Computer Science
language:en
Short-container-title:Electronic Notes in Theoretical Computer Science

Author:

Bolander Thomas,Hansen Jens Ulrik,Hansen Michael R.

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference28 articles.

1. Towards a general theory of action and time;Allen;Artifical Intelligence,1984

2. Modal Logic;Blackburn,2001

3. Bolander, T. and T. Braüner, Two tableau-based decision procedures for hybrid logic, in: H. Schlingloff, editor, Proceedings of the 4th Methods for Modalities (M4M) workshop (2005), pp. 79–96

4. A tableau-based decision procedure for right propositional neighbourhood logic;Bresolin,2005

5. Weak second-order arithmetic and finite automata;Buchi;Z. Math. Logik Grundl. Math,1960

Cited by 7 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A practical approach to model checking Duration Calculus using Presburger Arithmetic;Annals of Mathematics and Artificial Intelligence;2013-08-29

2. Hybrid Metric Propositional Neighborhood Logics with Interval Length Binders;Electronic Notes in Theoretical Computer Science;2011-07

3. Metric propositional neighborhood logics on natural numbers;Software & Systems Modeling;2011-02-26

4. Metric Propositional Neighborhood Logics: Expressiveness, Decidability, and Undecidability;FRONT ARTIF INTEL AP;2010

5. A duration calculus with neighborhood modalities;Journal of Applied Non-Classical Logics;2010-01