11 Temporal logic

https://doi.org/10.1016/S1570-2464(07)80014-0Get rights and content

Publisher Summary

Temporal logic is one of the classic branches of modal logic. It is remarkably fruitful in the issues it has raised, the results it has given rise to, and as an applied tool. This chapter focuses on the key issues related to temporal logic and examines some topics in temporal logic that are considered both in computer science and in other fields. A basic round-up of the semantic options for handling time is describes and some logics (syntax and evaluation) that can be used are explained. The expressivity of classical and modal-style logics is compared. Kamp's famous 1968 expressive completeness theorem, the temporal reasoning, tableaux, resolution, filtration- and the finite model property, and other methods are discussed. Temporal logics come in many forms and that motivations from computing or linguistic applications and philosophical, theoretical or mathematical interests have driven temporal logic research in many disparate directions. The structures supporting varying granularity of focus and the options when propositions depend on several time points are considered.

Bibliography (220)

  • R. Goré

    Cut-free sequent and tableau systems for propositional diodorean modal logics

    Studia Logica

    (1994)
  • T. Hafer et al.

    Computation tree logic CTL* and path quantifiers in the monadic the- ory of the binary tree

  • R. Hirsch et al.

    Mosaics and step-by-step (Remarks on 'A modal logic of relations')

  • I. Hodkinson

    Complexity of monodic packed fragment over linear and real time

    Annals of Pure and Applied Logic

    (2006)
  • I. Hodkinson et al.

    The k-variable property is stronger than k-dimension k

    J. Philosophical Logic

    (1997)
  • M. Abadi et al.

    Nonclausal Temporal Deduction

    Lecture Notes in Computer Science

    (1985)
  • M. Abadi et al.

    Non-clausal deduction in first-order temporal logic

    J. ACM

    (1990)
  • S. Abiteboul et al.

    Temporal connectives versus explicit timestamps in temporal query languages

  • S. Abiteboul et al.

    Temporal versus first-order logic in query temporal databases

  • M. Adler et al.

    An n! lower bound on formula size

    ACM Transactions on Computational Logic

    (2003)
  • J.F. Allen

    Maintaining knowledge about temporal intervals

    Communications of the ACM

    (1983)
  • R. Alur et al.

    Alternating-time temporal logic

    Journal of the ACM

    (2002)
  • A. Amir

    Expressive completeness failure in branching time structures

    Journal of Computer and System Sciences

    (1982)
  • A. Amir

    Functional Completeness in Tense Logic

  • S. Bauer et al.

    On non-local propositional and weak monodic quantified CTL*

    Journal of Logic and Computation

    (2004)
  • M. Ben-Ari

    Mathematical Logic for Computer Science

    (1993)
  • E. Beth

    Semantic entailment and formal derivability

    Mededelingen der Koninklijke Nederlandse Akad. van Wetensch

    (1955)
  • C. Bettini et al.

    Time Granularities in Databases, Data Mining, and Temporal Reasoning

    (2000)
  • N. Bidoit et al.

    Order independent temporal properties

    J. Logic Computat

    (2004)
  • P. Blackburn et al.

    Hybrid languages and temporal logic

    Logic Journal of the IGPL

    (1999)
  • A. Bochman

    Concerted instant-interval temporal semantics I: Temporal ontologies

    Notre Dame J. of Formal Logic

    (1990)
  • A. Bolotov et al.

    A Resolution Method for CTL Branching-Time Temporal Logic

  • P. Bouyer et al.

    On the expressiveness of TPTL and MTL

  • H. Bowman et al.

    Specification and prototyping of structured multimedia documents using interval temporal logic

  • J.R. Büchi

    On a decision method in restricted second order arithmetic

  • R.A. Bull

    An approach to tense logic

    Theoria

    (1970)
  • R.A. Bull et al.

    Basic modal logic

  • J.P. Burgess

    Logic and time

    J. Symbolic Logic

    (1979)
  • J.P. Burgess

    Decidability for branching time

    Studia Logica

    (1980)
  • J.P. Burgess

    Axioms for tense logic I: ‘Since’ and ‘Until’

    Notre Dame J. Formal Logic

    (1982)
  • J.P. Burgess

    Axioms for tense logic II. Time periods

    Notre Dame Journal of Formal Logic

    (1982)
  • J.P. Burgess

    Basic tense logic

  • J.P. Burgess et al.

    The decision problem for linear temporal logic

    Notre Dame J. Formal Logic

    (1985)
  • A. Cavalli et al.

    A Decision Method for Linear Temporal Logic

  • E.M. Clarke et al.

    Synthesis of synchronization skeletons for branching time temporal logic

  • A. Degtyarev et al.

    Monodic Temporal Resolution

  • A. Degtyarev et al.

    Equality and monodic first-order temporal logic

    Studia Logica

    (2002)
  • E. Emerson

    Automated temporal reasoning for reactive systems

  • E. Emerson et al.

    ‘Sometimes’ and ‘not never’ revisited: on branching versus linear time

    J. ACM

    (1986)
  • Cited by (0)

    View full text