Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

A separation theorem for discrete-time interval temporal logic

A separation theorem for discrete-time interval temporal logic Gabbay's separation theorem about linear temporal logic with past has proved to be one of the most useful theoretical results in temporal logic. In this paper, we establish an analogous statement about Moszkowski's discrete-time propositional Interval Temporal Logic ( ) with two sets of expanding modalities, namely the unary neighbourhood modalities and the binary weak inverses of 's chop operator. We prove that separation holds for both with and without its loop construct chop-star. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Journal of Applied Non-Classical Logics Taylor & Francis

A separation theorem for discrete-time interval temporal logic

Download PDF
27 pages

Loading next page...
 
/lp/taylor-francis/a-separation-theorem-for-discrete-time-interval-temporal-logic-KSpUuwSJ3a

References

References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.

Publisher
Taylor & Francis
Copyright
© 2022 Informa UK Limited, trading as Taylor & Francis Group
ISSN
1958-5780
eISSN
1166-3081
DOI
10.1080/11663081.2022.2050135
Publisher site
See Article on Publisher Site

Abstract

Gabbay's separation theorem about linear temporal logic with past has proved to be one of the most useful theoretical results in temporal logic. In this paper, we establish an analogous statement about Moszkowski's discrete-time propositional Interval Temporal Logic ( ) with two sets of expanding modalities, namely the unary neighbourhood modalities and the binary weak inverses of 's chop operator. We prove that separation holds for both with and without its loop construct chop-star.

Journal

Journal of Applied Non-Classical Logics – Taylor & Francis

Published: Jan 2, 2022

Keywords: Gabbay separation; interval temporal logic; expanding modalities

References

  • Maintaining knowledge about temporal intervals
  • A decision procedure and complete axiomatisation of finite interval temporal logic with projection
  • Interval vs. point temporal logic model checking: An expressiveness comparison
  • Which fragments of the interval temporal logic HS are tractable in model checking?
  • Alternating-time temporal logics with linear past
  • Propositional interval neighborhood logics: Expressiveness, decidability, and undecidable extensions
  • Optimal decision procedures for MPNL over finite structures, the natural numbers, and the integers
  • An optimal decision procedure for right propositional neighborhood logic
  • Derivatives of regular expressions
  • A proof of the Krohn-Rhodes decomposition theorem
  • Propositional dynamic logic of regular programs
  • A normal form for temporal logics and its applications in theorem-proving and execution
  • Propositional interval neighborhood temporal logics
  • A road map of interval temporal logics and duration calculi
  • Probabilistic interval temporal logic and duration calculus with infinite intervals: Complete proof systems
  • A syntactical proof of the canonical reactivity form for past linear temporal logic
  • The algebraic theory of machines I
  • Checking interval properties of computations
  • Interval temporal logics: A journey
  • Temporal logic for multilevel reasoning about hardware
  • A hierarchical completeness proof for propositional interval temporal logic with finite time
  • A modal logic for chopping intervals
  • A calculus of durations