Abstract
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.
Preview
Unable to display preview. Download preview PDF.
References
M. Fujita, "Temporal Logic Based Hardware Description and Its Verification with Prolog", New Generation Computing, Vol. 1, No. 2, pp. 195–203 1983.
B. Moszkowski, "Reasoning about Digital Circuits", Report No. STAN-CS-83-970, Department of Computer Science, Stanford University, July 1983.
F. Pereira, "C-Prolog Users Manual Version 1.5" EdCAD, Edinburgh Univ. 1984.
E. Shapiro, "A subset of Concurrent Prolog and its Interpreter", TR-003, ICOT 1983.
K. Ueda, "Guarded Horn Clauses", TR-103, ICOT, 1985
D. Warren, "AN ABSTRACT RPOLOG INSTRUCTION SET", Technical Note 309, SRI International, October 1983.
P. Wolper, "Temporal logic Can Be More Expressive", 22nd Annual Symposium on Foundation of Computer Science, October 1981.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1986 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kono, S., Aoyagi, T., Fujita, M., Tanaka, H. (1986). Implementation of temporal logic programming language Tokio. In: Wada, E. (eds) Logic Programming '85. LP 1985. Lecture Notes in Computer Science, vol 221. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-16479-0_14
Download citation
DOI: https://doi.org/10.1007/3-540-16479-0_14
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-16479-1
Online ISBN: 978-3-540-39820-2
eBook Packages: Springer Book Archive