Ma, J. and Knight, B. (2001) Reified temporal logics: an overview. Artificial Intelligence Review, 15 (3). pp. 189-217. ISSN 0269-2821 (Print), 1573-7462 (Online) (doi:https://doi.org/10.1023/A:1011018426725)

Full text not available from this repository.

Abstract

There are three main approaches to the representation of temporal information in AI literature: the so-called method of temporal arguments that simply extends functions and predicates of first-order language to include time as the additional argument; modal temporal logics which are extensions ofthe propositional or predicate calculus with modal temporal operators; and reified temporal logics which reify standard propositions of some initial language (e.g., the classical first-order or modal logic) as objects denoting propositional terms. The objective of this paper is to provide an overview onthe temporal reified approach by looking closely atsome representative existing systems featuring reified propositions, including those of Allen, McDermott, Shoham, Reichgelt, Galton, and Ma and Knight. We shall demonstrate that, although reified logics might be more complicated in expressing assertions about some given objects with respect to different times, they accord a special status to time and therefore have several distinct advantages in talking about some important issues which would be difficult (if not impossible) to express in other approaches.

Item Type:	Article
Additional Information:	[1] CMS Ref. No: 01/72.
Uncontrolled Keywords:	logical formalism, reification, temporal logic
Subjects:	B Philosophy. Psychology. Religion > BC Logic Q Science > QA Mathematics
Pre-2014 Departments:	School of Computing & Mathematical Sciences School of Computing & Mathematical Sciences > Computer & Computational Science Research Group School of Computing & Mathematical Sciences > Department of Computer Science
Related URLs:	Publisher Publisher Organisation
Last Modified:	14 Oct 2016 08:59
URI:	http://gala.gre.ac.uk/id/eprint/240

Actions (login required)

View Item