Abstract
The programming language TPL that is presented in this paper is a complete combination of PROLOG with a temporal language (the CTL language or other temporal languages expressed in atomata). It can be used to serve or reason along paths in a directed graph (a Kripke structure) which consists of many rule databases. At the end of the paper, a compiler (an algorithm) for reasoning language TPL has been supplied.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Abadi, M. and Manna, Z., ‘Temporal Logic Programming’, Proc. 4th IEEE Symposium on Logic Programming (1987).
Clarke, E. M., Emerson, E. M., and Sistla, A. P., ‘Automatic Verification of Finite-State Concurrent Systems Using Temporal Logic Specifications’, ACM Trans. Programming Lang. Systems, 8 (2), 244–263 (1986).
Farinas del Cerro, L. ‘Molog: A System that Extends PROLOG with Modal Logic’ New Generation Computing, 4 (1) 35–50 (1986).
Martelli, A. and Montanari, U., ‘An Efficient Unification Algorithm’, ACM Trans. Programming Lang. Systems, 4 (2), 258–282 (1982).
Tang, T. G. and Zhao, Z. K., ‘Stack Method in Program Semantics’, J. Computer Sci. Technol. (China), 2 (1), 51–63 (1987).
Tang T. G., ‘A Completeness Theorem of First-Order Temporal Logic with the Equality’, Scientia Sinica (Series A) (China) XXVIII (5) (1985).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Tang, T.G. Temporal logic CTL + PROLOG. J Autom Reasoning 5, 49–65 (1989). https://doi.org/10.1007/BF00245021
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00245021