Temporal logics and their applications, edited by Antony Galton, Academic Press, London, San Diego, etc., 1987, xii + 244 pp.—Therein: - Antony Galton. Temporal logic and computer science: an overview. Pp. 1– 52. - Howard Barringer. The use of temporal logic in the compositional specification of concurrent systems. Pp. 53– 90. - Roger Hale. Temporal logic programming. Pp. 91– 119. - Fariba Sadri. Three recent approaches to temporal reasoning. Pp. 121– 168. - Antony Galton. The logic of occurrence. Pp. 169– 196. - Dov Gabbay. Modal and temporal logic programming. Pp. 197– 237.

1990 ◽  
Vol 55 (1) ◽  
pp. 364-366
Author(s):  
Luis Fariñas Del Cerro
1989 ◽  
Vol 4 (2) ◽  
pp. 141-162 ◽  
Author(s):  
Derek Long

AbstractA series of temporal reasoning tasks are identified which motivate the consideration and application of temporal logics in artificial intelligence. There follows a discussion of the broad issues involved in modelling time and constructing a temporal logic. The paper then presents a detailed review of the major approaches to temporal logics: first-order logic approaches, modal temporal logics and reified temporal logics. The review considers the most significant exemplars within the various approaches, including logics due to Russell, Hayes and McCarthy, Prior, McDermott, Allen, Kowalski and Sergot. The logics are compared and contrasted, particularly in their treatments of change and action, the roles they seek to fulfil and the underlying models of time on which they rest. The paper concludes with a brief consideration of the problem of granularity—a problem of considerable significance in temporal reasoning, which has yet to be satisfactorily treated in a temporal logic.


2008 ◽  
Vol 70 (1) ◽  
pp. 31-61 ◽  
Author(s):  
Zhenhua Duan ◽  
Xiaoxiao Yang ◽  
Maciej Koutny

1989 ◽  
Vol 8 (3) ◽  
pp. 277-295 ◽  
Author(s):  
Martín Abadi ◽  
Zohar Manna

2015 ◽  
Vol 15 (4-5) ◽  
pp. 666-680 ◽  
Author(s):  
PEDRO CABALAR ◽  
MARTÍN DIÉGUEZ ◽  
CONCEPCIÓN VIDAL

AbstractThis paper studies the relation between two recent extensions of propositional Equilibrium Logic, a well-known logical characterisation of Answer Set Programming. In particular, we show how Temporal Equilibrium Logic, which introduces modal operators as those typically handled in Linear-Time Temporal Logic (LTL), can be encoded into Infinitary Equilibrium Logic, a recent formalisation that allows the use of infinite conjunctions and disjunctions. We prove the correctness of this encoding and, as an application, we further use it to show that the semantics of the temporal logic programming formalism called TEMPLOG is subsumed by Temporal Equilibrium Logic.


Sign in / Sign up

Export Citation Format

Share Document