Reified Temporal Logics: An Overview

  • Authors:

  • J. Ma;B. Knight

  • Affiliations:

  • School of CMS, University of Greenwich, Woolwich, London SE18 6PF, UK (E-mail: j.ma@greenwich.ac.uk);School of CMS, University of Greenwich, Woolwich, London SE18 6PF, UK

  • Venue:
  • Artificial Intelligence Review
  • Year:
  • 2001

Quantified Score

Hi-index 0.00

Visualization

Abstract

There are three main approaches to the representationof temporal information in AI literature: theso-called method of temporal arguments thatsimply extends functions and predicates of first-orderlanguage to include time as the additional argument;modal temporal logics which are extensions ofthe propositional or predicate calculus with modaltemporal operators; and reified temporal logicswhich reify standard propositions of some initiallanguage (e.g., the classical first-order or modallogic) as objects denoting propositional terms. Theobjective of this paper is to provide an overview onthe temporal reified approach by looking closely atsome representative existing systems featuring reifiedpropositions, including those of Allen, McDermott,Shoham, Reichgelt, Galton, and Ma and Knight. We shalldemonstrate that, although reified logics might bemore complicated in expressing assertions about somegiven objects with respect to different times, theyaccord a special status to time and therefore haveseveral distinct advantages in talking about someimportant issues which would be difficult (if notimpossible) to express in other approaches.