Advertisement

On an ω-Decidable Deductive Procedure for Non-Horn Sequents of a Restricted FTL

  • Regimantas Pliuškevičius
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1861)

Abstract

A new deduction-based procedure is presented for non-Horn, so-called DR-sequents with repetitions of a restricted first-order linear temporal logic with temporal operators “next” and “always”. The main part of the proposed deductive procedure is automatic generation of the inductive hypothesis. The proposed deductive procedure consists of three separate decidable deductive procedures replacing the infinitary omega-type rule for the operator “always”. These three decidable parts cannot be joined. Therefore the proposed deductive procedure (by analogy with ω-completeness) is only ω-decidable. The specific shape of DR-sequents allows us in all the three parts of the proposed deductive procedure to construct: (1) a deduction tree in some linear form, i.e., with one ”temporal” branch; (2) length-preserving derivations, i.e., the lengths of generated sequents are the same.

Keywords

Similarity Index Temporal Logic Function Symbol Atomic Formula Linear Temporal Logic 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Abadi M.: The power of temporal proofs. Theoretical Comp. Sci. 64 (1989) 35–84.CrossRefMathSciNetGoogle Scholar
  2. 2.
    Fisher M.: A normal form for temporal logics and its applications in theorem proving and execution. Journal of Logic and Computation 7(4) (1997).Google Scholar
  3. 3.
    Fisher M., Wooldridge M.: On the formal specification and verification of multi-agent systems. Intern. Journal of Cooperative Information Systems 6(1) (1997) 37–65.CrossRefGoogle Scholar
  4. 4.
    Hodkinson I., Wolter F., Zakharyaschev M.: Decidable fragments of first-order temporal logics. (To appear in: Annals of Pure and Applied Logic).Google Scholar
  5. 5.
    Kawai H.: Sequential calculus for a first-order infinitary temporal logic. Zeitchr. fur Math. Logic und Grundlagen der Math. 33 (1987) 423–452.zbMATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Pliuškevičius R.: The saturated tableaux for a linear miniscoped Horn-like temporal logic. Journal of Automated Reasoning 13 (1994) 51–67.Google Scholar
  7. 7.
    Pliuškevičius R.: Replacement of induction by similarity saturation in a first-order linear temporal logic. Journal of Applied Non-Classical Logics 8(1–2) (1998) 141–169.MathSciNetzbMATHGoogle Scholar
  8. 8.
    Pliuškevičius R.: Infinitary calculus for a restricted first-order linear temporal logic without contraction of quantified formulas. Lithuanian Mathematical Journal 39(3) (1999) 378–397.MathSciNetGoogle Scholar
  9. 9.
    Pliuškevičius R.: An effective deductive procedure for a restricted first-order linear temporal logic. (Submitted to Annals of Pure and Applied Logic).Google Scholar
  10. 10.
    Szalas A.: Concerning the semantic consequence relation in first-order temporal logic. Theoretical Comput. Sci. 47 (1986) 329–334.zbMATHCrossRefMathSciNetGoogle Scholar
  11. 11.
    Szalas A.: A complete axiomatic characterization of first-order temporal logic of linear time. Theoretical Comput. Sci. 54 (1987) 199–214.zbMATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2000

Authors and Affiliations

  • Regimantas Pliuškevičius
    • 1
  1. 1.Institute of Mathematics and InformaticsVilniusLithuania

Personalised recommendations