Towards a general theory of action and time
Artificial Intelligence
A propositional modal logic of time intervals
Journal of the ACM (JACM)
Non-elementary lower bound for propositional duration calculus
Information Processing Letters
Modal logic
Specifying and Verifying Requirements of Real-Time Systems
IEEE Transactions on Software Engineering
A Hardware Semantics Based on Temporal Intervals
Proceedings of the 10th Colloquium on Automata, Languages and Programming
Decidability and Undecidability Results for Duration Calculus
STACS '93 Proceedings of the 10th Annual Symposium on Theoretical Aspects of Computer Science
Take It NP-Easy: Bounded Model Construction for Duration Calculus
FTRTFT '02 Proceedings of the 7th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems: Co-sponsored by IFIP WG 2.2
Tableau-Based Automated Deduction for Duration Calculus
TABLEAUX '02 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Duration Calculus: A Formal Approach to Real-Time Systems (Monographs in Theoretical Computer Science. an Eatcs Seris)
Model-checking dense-time Duration Calculus
Formal Aspects of Computing
A tableau-based decision procedure for right propositional neighborhood logic
TABLEAUX'05 Proceedings of the 14th international conference on Automated Reasoning with Analytic Tableaux and Related Methods
Spatio-temporal model checking for mobile real-time systems
ICTAC'06 Proceedings of the Third international conference on Theoretical Aspects of Computing
A theory of duration calculus with application
Domain modeling and the duration calculus
Metric Propositional Neighborhood Logics: Expressiveness, Decidability, and Undecidability
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Hybrid Metric Propositional Neighborhood Logics with Interval Length Binders
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.02 |
We present a logic which we call Hybrid Duration Calculus (HDC). HDC is obtained by adding the following hybrid logical machinery to the Restricted Duration Calculus (RDC): nominals, satisfaction operators, down-arrow binder, and the global modality. RDC is known to be decidable, and in this paper we show that decidability is retained when adding the hybrid logical machinery. Decidability of HDC is shown by reducing the satisfiability problem to satisfiability of Monadic Second-Order Theory of Order. We illustrate the increased expressive power obtained in hybridizing RDC by showing that HDC, in contrast to RDC, can express all of the 13 possible relations between intervals.