Skip to main content
SpringerLink
Log in

On saturation with flexible function symbols

  • Contributed Papers
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1996 (MFCS 1996)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1113))

  • 159 Accesses

Abstract

The paper extends the similarity saturation calculus [8] by including flexible function symbols. The most attractive property of the similarity saturation calculus consists in that it allows to build derivations constructively both for a finitary complete and finitary incomplete first order linear temporal logic. The saturation calculus contains the so-called alternating rule and this rule splits off the logical part from the temporal one in the quasi-primary sequents. If the saturation process involves unification and flexible function symbols, then the alternating rule includes (in the temporal part of the rule) renaming of variables and a replacement of flexible function symbols by rigid ones. The employment of flexible symbols means the introduction of some kind of constraints in the saturation process.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. H. Andreka, J. Nemeti, J. Sain: On the strenghth of temporal proof, LNCS, 379, 135–144 (1989).

    Google Scholar 

  2. Ben-Ari: Mathematical Logic for Computer Science, Prentice Hall, 1993.

    Google Scholar 

  3. M. Fisher: A normal form for first order temporal formulae, LNCS, 607, 370–384 (1992).

    Google Scholar 

  4. D.M. Gabbay: The declarative past and the imperative future, LNCS, 398, 409–448 (1987).

    Google Scholar 

  5. H. Kawai: Sequential calculus for a first order infinitary temporal logic, Zeitchr. fur Math. Logic und Grundlagen der Math., 33, 423–452 (1987).

    Google Scholar 

  6. R. Pliuškevičius: On saturated calculi for a linear temporal logic, LNCS 711, 640–649 (1993).

    Google Scholar 

  7. R. Pliuškevičius: The saturated tableaux for linear miniscoped Horn-like temporal logic, Journal of Automated Reasoning, 13, 51–67 (1994).

    Google Scholar 

  8. R. Pliuškevičius: On the replacement of induction for a first order linear temporal logic, Proc. of Second World Conf. on the Fund. of Artif. Intell., 331–342 (1995).

    Google Scholar 

  9. I. Sain: Temporal logics need their clocks. Theoret. Comput. Sci., 95, 75–95(1992).

    Article  Google Scholar 

  10. J. Sakalauskaitė: A sequent calculus for a first order linear temporal logic with equality. LNCS, 620, 430–440 (1992).

    Google Scholar 

  11. A. Szalas: Concerning the semantic consequence relation in first-order temporal logic, Theoret. Comput. Sci. 47, 329–334 (1986).

    Article  Google Scholar 

  12. P. Wolper: The tableaux method for temporal logic: an overview, Log. et anal. 28, 119–136 (1985).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Mathematics and Informatics, Akademijos 4, 2600, Vilnius, Lithuania

    Regimantas Pliuškevičius

Authors
  1. Regimantas Pliuškevičius
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Wojciech Penczek Andrzej Szałas

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Pliuškevičius, R. (1996). On saturation with flexible function symbols. In: Penczek, W., Szałas, A. (eds) Mathematical Foundations of Computer Science 1996. MFCS 1996. Lecture Notes in Computer Science, vol 1113. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61550-4_172

Download citation

  • DOI: https://doi.org/10.1007/3-540-61550-4_172

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-61550-7

  • Online ISBN: 978-3-540-70597-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation