Chronolog(Z): linear-time logic programming

Mehmet A. Orgun; William W. Wadge; Weichang Du

doi:10.1109/ICCI.1993.315313

Chronolog(Z): linear-time logic programming

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

^*Corresponding author for this work

School of Computing

Research output: Chapter in Book/Report/Conference proceeding › Conference proceeding contribution › peer-review

7 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 language	English
Title of host publication	Proceedings - ICCI 1993
Subtitle of host publication	5th International Conference on Computing and Information
Editors	Osman Abou-Rabia, Carl K. Chang, Waldemar W. Koczkodaj
Publisher	Institute of Electrical and Electronics Engineers (IEEE)
Pages	545-549
Number of pages	5
ISBN (Electronic)	0818642122, 9780818642128
DOIs	https://doi.org/10.1109/ICCI.1993.315313
Publication status	Published - 1993
Event	5th International Conference on Computing and Information, ICCI 1993 - Sudbury, Canada Duration: 27 May 1993 → 29 May 1993

Conference

Conference	5th International Conference on Computing and Information, ICCI 1993
Country/Territory	Canada
City	Sudbury
Period	27/05/93 → 29/05/93

Access to Document

10.1109/ICCI.1993.315313

Cite this

@inproceedings{dd4e9534f6764979b4c635f0d55b7558,

title = "Chronolog(Z): linear-time logic programming",

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.",

author = "Orgun, \{Mehmet A.\} and Wadge, \{William W.\} and Weichang Du",

year = "1993",

doi = "10.1109/ICCI.1993.315313",

language = "English",

pages = "545--549",

editor = "Osman Abou-Rabia and Chang, \{Carl K.\} and Koczkodaj, \{Waldemar W.\}",

booktitle = "Proceedings - ICCI 1993",

publisher = "Institute of Electrical and Electronics Engineers (IEEE)",

address = "United States",

note = "5th International Conference on Computing and Information, ICCI 1993 ; Conference date: 27-05-1993 Through 29-05-1993",

}

Orgun, MA, Wadge, WW & Du, W 1993, Chronolog(Z): linear-time logic programming. in O Abou-Rabia, CK Chang & WW Koczkodaj (eds), Proceedings - ICCI 1993: 5th International Conference on Computing and Information., 315313, Institute of Electrical and Electronics Engineers (IEEE), pp. 545-549, 5th International Conference on Computing and Information, ICCI 1993, Sudbury, Canada, 27/05/93. https://doi.org/10.1109/ICCI.1993.315313

Chronolog(Z): linear-time logic programming. / Orgun, Mehmet A.; Wadge, William W.; Du, Weichang.
Proceedings - ICCI 1993: 5th International Conference on Computing and Information. ed. / Osman Abou-Rabia; Carl K. Chang; Waldemar W. Koczkodaj. Institute of Electrical and Electronics Engineers (IEEE), 1993. p. 545-549 315313.

Research output: Chapter in Book/Report/Conference proceeding › Conference proceeding contribution › peer-review

TY - GEN

T1 - Chronolog(Z)

T2 - 5th International Conference on Computing and Information, ICCI 1993

AU - Orgun, Mehmet A.

AU - Wadge, William W.

AU - Du, Weichang

PY - 1993

Y1 - 1993

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/85028022561

U2 - 10.1109/ICCI.1993.315313

DO - 10.1109/ICCI.1993.315313

M3 - Conference proceeding contribution

AN - SCOPUS:85028022561

SP - 545

EP - 549

BT - Proceedings - ICCI 1993

A2 - Abou-Rabia, Osman

A2 - Chang, Carl K.

A2 - Koczkodaj, Waldemar W.

PB - Institute of Electrical and Electronics Engineers (IEEE)

Y2 - 27 May 1993 through 29 May 1993

ER -

Chronolog(Z): linear-time logic programming

Abstract

Conference

Access to Document

Other files and links

Fingerprint

Cite this