Chronolog(Z): linear-time logic programming

This paper introduces Chronolog(Z), a logic programming language based on a discrete linear-time temporal logic with unbounded past and future. Chronolog(Z) is suitable for applications involving the notion of dynamic change such as modeling non-terminating computations, the simulation of sequential circuits, and temporal databases. The execution of the programs of the language is based on a resolution-type proof procedure called TiSLD-resolution. A modular extension of Chronolog(Z) is proposed which can be used to model objects with internal memory