Chronolog(Z)

linear-time logic programming

Mehmet A. Orgun*, William W. Wadge, Weichang Du

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference proceeding contribution

6 Citations (Scopus)

Abstract

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.

Original languageEnglish
Title of host publicationProceedings - ICCI 1993
Subtitle of host publication5th International Conference on Computing and Information
EditorsOsman Abou-Rabia, Carl K. Chang, Waldemar W. Koczkodaj
PublisherInstitute of Electrical and Electronics Engineers (IEEE)
Pages545-549
Number of pages5
ISBN (Electronic)0818642122, 9780818642128
DOIs
Publication statusPublished - 1993
Event5th International Conference on Computing and Information, ICCI 1993 - Sudbury, Canada
Duration: 27 May 199329 May 1993

Conference

Conference5th International Conference on Computing and Information, ICCI 1993
CountryCanada
CitySudbury
Period27/05/9329/05/93

Fingerprint Dive into the research topics of 'Chronolog(Z): linear-time logic programming'. Together they form a unique fingerprint.

Cite this