Implementation of temporal logic programming language Tokio
The temporal logic programming language, "Tokio" can be executed by a resolution of Interval Temporal Logic. The resolution consists of three parts, which are: the unification of the temporal variable, reduction including temporal operator, and interval control. The implementation of Tokio includes automatic interval length determination and stream-like temporal variable representation. At the end of this report, an abbreviated version of a Tokio interpreter written in Prolog will be shown.
KeywordsTemporal Logic Primary Negation Systolic Array Horn Clause Linear Time Temporal Logic
Unable to display preview. Download preview PDF.
- M. Fujita, "Temporal Logic Based Hardware Description and Its Verification with Prolog", New Generation Computing, Vol. 1, No. 2, pp. 195–203 1983.Google Scholar
- B. Moszkowski, "Reasoning about Digital Circuits", Report No. STAN-CS-83-970, Department of Computer Science, Stanford University, July 1983.Google Scholar
- F. Pereira, "C-Prolog Users Manual Version 1.5" EdCAD, Edinburgh Univ. 1984.Google Scholar
- E. Shapiro, "A subset of Concurrent Prolog and its Interpreter", TR-003, ICOT 1983.Google Scholar
- K. Ueda, "Guarded Horn Clauses", TR-103, ICOT, 1985Google Scholar
- D. Warren, "AN ABSTRACT RPOLOG INSTRUCTION SET", Technical Note 309, SRI International, October 1983.Google Scholar
- P. Wolper, "Temporal logic Can Be More Expressive", 22nd Annual Symposium on Foundation of Computer Science, October 1981.Google Scholar