Chronolog admits a complete proof procedurey
MEHMET A. ORGUN
Department of Computing, Macquarie University
Sydney, NSW 2109, Australia
WILLIAM W. WADGE
Department of Computer Science, University of Victoria
Victoria, B.C. V8W 3P6, Canada
Chronolog(Z) is a logic programming language based on a linear-time temporal logic with unbounded past and future. It is suitable for applications involving the notion of dynamic change such as modelling periodical changes, non-terminating computations and temporal databases. The declarative semantics of Chronolog(Z) programs are given in terms of temporal Herbrand models and the operational semantics in terms of a resolution-type proof procedure called TiSLD-resolution. TiSLD-resolution is based on the axioms and the rules of inference of the underlying temporal logic. It is shown that TiSLD-resolution is sound and complete. The equivalence of the declarative and the operational semantics of Chronolog(Z) programs is also established.
AMS Subject Classification: 68N17 (Logic Programming).
Temporal logic has been widely used as a formalism in concurrent program specification and verification , modelling temporal databases  and various forms of temporal reasoning . In temporal logic , the meanings of formulas vary depending on an implicit time parameter and elements from different moments in time can be combined through the use of temporal operators. Therefore temporal logic can model time-dependent and dynamic properties of certain problems in a natural and problem-oriented way. More recently, several researchers have suggested that temporal logic can be directly used as a programming language in applications involving the notion of dynamic change. A number of logic programming languages based on diverse temporal logics have been proposed: Tempura  and Tokio  are based on interval logic; Templog  and Chronolog  are based on linear-time temporal logic and Temporal Prolog  is based on linear and branching time temporal logics.
yTo be presented at ISLIP'93: The Sixth International Symposium on Lucid and Intensional Programming, April 26-27, 1993, Universit?e Laval, Qu?ebec City, Canada.