Abstract
The paper presents an hybrid reasoning system — similarity saturation — for first order linear temporal logic with “next” and “unless”. The most attractive property of the similarity saturation calculus consists in that it allows to build derivations uniformly and constructively both for a finitary complete and finitary incomplete first order linear temporal logic.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
M. Abadi: The power of temporal proofs. Theoret. Comput. Sci. 64, 35–84 (1989)
H. Andreka, J. Nemeti, J. Sain: On the strenghth of temporal proof. LNCS 379, 135–144 (1989)
H. Barringer: Up and down the temporal way. The Comput Journ. 30, 134–148 (1987)
H. Barringer: The use of temporal logic in the compositional specification of concurrent systems. In: A. Galton (ed.): Temporal logics and their applications. London: Academic Press 1987, pp. 53–90
M. Ben-Ari: Mathematical Logic for Computer Science. Prentice Hall 1993
M. Fisher: A normal form for first order temporal formulae. LNCS 607, 370–384 (1992)
D.M. Gabbay: The declarative past and the imperative future. LNCS 398, 409–448 (1987)
M. Gabbay, I. Hodkinson, M. Reynolds: Temporal logic. Mathematical Foundations and Computational Aspects. Vol. 1. Oxford Science Foundations. Oxford: Claredon Press 1994
F. Kroger: Temporal Logic of Programs. Berlin etc: Spriger-Verlag 1987
F. Kroger: On the interpretability of arithmetic in temporal logic. Theoret. Comput. Sci. 73, 47–60 (1990)
Z. Manna, A. Pnueli: The Temporal Logic of Reactive and Concurrent Systems Specifications. New York etc: Springer-Verlag 1992
R. Pliuškevičius: Complete sequential calculi for the first order symmetrical linear temporal logic with UNTIL and SINCE. LNCS 620, 382–393 (1992)
R. Pliuškevičius: On saturation principle for a linear temporal logic. LNCS 713, 289–300 (1993)
R. Pliuškevičius: The saturated tableaux for linear miniscoped Horn-like temporal logic. Journal of Automated Reasoning 13, 51–67 (1994)
R. Pliukevičius: On the replacement of induction for a first order linear temporal logic. Proc. of Second World Conf. on the Fund. of Artif. Intell. 1995, pp. 331–342
I. Sain: Temporal logics need their clocks. Theoret. Comput. Sci. 95, 75–95 (1992
J. Sakalauskaitė: A sequent calculus for a first order linear temporal logic with equality. LNCS 620, 430–440
A. Szalas: A complete axiomatic characterization of first order temporal logic of linear time. Theoret. Comput. Sci. 54, 199–214 (1987)
A. Szalas, L. Holenderski: Incompleteness of first-order logic with UNTIL. Theoret. Comput. Sci. 57, 317–325 (1988)
J.G. Thistle, W.M. Wonham: Control problems in a temporal logic framework. Int. J. Control 44, 943–976 (1986)
P. Wolper: The tableaux method for temporal logic: an overview. Log. et anal. 28, 119–136 (1985)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pliuškevičius, R. (1996). Similarity saturation for first order linear temporal logic with UNLESS. In: Alferes, J.J., Pereira, L.M., Orlowska, E. (eds) Logics in Artificial Intelligence. JELIA 1996. Lecture Notes in Computer Science, vol 1126. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61630-6_23
Download citation
DOI: https://doi.org/10.1007/3-540-61630-6_23
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61630-6
Online ISBN: 978-3-540-70643-4
eBook Packages: Springer Book Archive