Temporal logic programming
type: Item
instance of: scholarly article
title: Temporal logic programming
zbMATH Open document ID: 0691.03015
DOI: 10.1016/S0747-7171(89)80070-7
author: Martín Abadi
author: Zohar Manna
published in: Journal of Symbolic Computation
publication date: 1989-01-01T00:00:00Z
review text: To exploit efficient temporal proof techniques, a special programming language, TEMPLOG, is proposed. It extends the classical PROLOG-like languages to include temporal operators. TEMPLOG programs will then be collections of ``temporal'' Horn clauses and, the main idea, they will be interpreted with the help of ``temporal'' SLD-resolution. General features of TEMPLOG programming and reasoning are emphasized, and comparisons with other existing temporal logic languages are provided.
Mathematics Subject Classification ID: 03B70
Mathematics Subject Classification ID: 03B35
Mathematics Subject Classification ID: 68N01
Mathematics Subject Classification ID: 68T15
zbMATH DE Number: 4130353
zbMATH Keywords: temporal logic
zbMATH Keywords: logic programming
zbMATH Keywords: TEMPLOG
zbMATH Keywords: temporal operators
zbMATH Keywords: SLD- resolution
reviewed by: Cristian Masalagiu
describes a project that uses: Lucid
MaRDI profile type: Publication
cites work: Q3682464
cites work: Q3678639
cites work: Q3919057
cites work: Q3716279
cites work: Q3729994
cites work: Q4733441
cites work: Specifying Concurrent Program Modules
cites work: Q3339245
cites work: Q3680239
cites work: The temporal semantics of concurrent programs
description: scientific article; zbMATH DE number 4130353