Theory and practice of tern poral logic programming
Mehmet Ali Orgun, William W. Wadge · 1992
Abstract Chronolog is a logic programming language based on temporal logic and possible worlds semantics. Temporal logic allows us to describe dynamic and time-dependent properties of certain problems in a direct and problem-oriented way. In Chronolog programs, users specify time-varying predicates; thus the notion of dynamic change and dataflow-style of non-terminating computations can be naturally specified in Chronolog. The declarative semantics of Chronolog programs can be characterized in terms of the least model semantics; hence Chronolog does not have some of the problems associated with non-logical extensions of logic programming. Chronolog extended with choice predicates (arbitrary single-valued relations) is suitable for modelling mutual exclusion problems such as that of the dining philosophers. A natural extension of Chronolog with modules allows us to specify objects with internal memory.