This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
M.Abadi, The power of temporal proofs, Theoret. Comput. Sci., Vol. 64, (1989), 35–84.
M.Abadi, Z.Manna, Temporal logic programming, Journal Symbolic Computation, Vol. 8, (1989), 277–295.
M.Abadi, Z.Manna, A timely resolution, First annual symposium on logic in Computer Science, (1987), 123–130.
H.Andreka, J.Nemeti, J.Sain, Henkin-type semantics for program schemes to turn negative results to positive, In: FCT-79, ed.: Budach, Akademia Verlag, Berlin, Band 2 (1979), 18–24.
H.Andreka, J.Nemeti, J.Sain, On the strength of temporal proofs, LNCS, Vol. 379, (1989), 135–144.
H.Barringer, M.Fisher, D.Gabbay, G.Gough, R.Owens, METATEM: A framework for programming in temporal logic, Technical Report Series, UMCS 89-10-4, Department of Computer Science, University of Manchester, 1989.
D.Gabbay, Decidability of some intuitionistic predicate theories, JSL, Vol. 37, (1972), 579–587.
J.H.Gallier, Logic for computer Science: Foundations of Automatic Theorem Proving, Harper and Row, New York, 1986.
D.Gallin., Intensional and higher-order modal logic, North-Holland, Math. Studies 19, 1975.
R.Hale, Temporal logic programming, in book:, Temporal logics and their applications, ed. A.Galton, Academic Press, London, 1987.
H.Kawai, Sequential calculus for a first order infinitary temporal logic, Zeitshr. für Math. Logic und Grundlagen der Math., Vol. 33 (1987), 423–432.
F.Kroger, On the interpretability of arithmetic in temporal logic, Theoret. Comput. Sci., Vol. 73 (1990), 47–60.
L.L.Maksimova, Interpolation, Beth's property and temporal logic “tomorrow”, (in Russian), Preprint No. 90 of Math. Institute of Sibirian Division of the USSR Academy of Sciences, Novosibirsk, 1989.
S.J.Maslov, Invertible sequential calculus for predicate constructive logic, (in Russian), Zap. Naučn. Sem. Leningrad. Otdel. Mat. Inst. Steklov (LOMJ), Vol. 4, (1967), 96–111.
D.Miller, G.Nadathur, A.Scedrov, Uniform proofs as foundation for logic programming, Annals of Pure and Applied Logic, Vol. 51, (1991), 125–157.
G.Mints, Gentzen-type systems and resolution rules. Part 1. Prepositional logic. LNCS, Vol. 417, 198–231.
G.Mints, Skolem's method of elimination of positive quantifiers in sequential calculi, Soviet Math. Dokl. Vol. 7, (1966), 861–864.
B.Moszkowski, Executing temporal programs, Technical Report No. 55, Computer Laboratory, University of Cambridge. 1984.
R.Pliuškevičius, Investigation of finitary calculi for temporal logics by means of infinitary calculi, LNCS, Vol. 452, (1990), 464–469.
R.Pliuškevičius, Investigation of finitary calculus for a discrete linear time logic by means of finitary calculus, LNCS, Vol. 502, (1991), 504–528.
K.Segerberg, Temporal logic of von Wright, (in Russian), Logical derivation. Moscow, “Nauka”, (1979), 173–205.
A.Szalas, L.Holenderski, Incompleteness of first-order temporal logic with UNTIL, Theoret. Comput. Sci, Vol. 57, (1988), 317–325.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pliuškevičius, R. (1992). Logical foundation for logic programming based on first order linear temporal logic. In: Voronkov, A. (eds) Logic Programming. Lecture Notes in Computer Science, vol 592. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55460-2_29
Download citation
DOI: https://doi.org/10.1007/3-540-55460-2_29
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55460-8
Online ISBN: 978-3-540-47083-0
eBook Packages: Springer Book Archive