Skip to main content
Springer Nature Link
Log in

Deduction-Based Decision Procedure for a Clausal Miniscoped Fragment of FTL

  • Conference paper
  • First Online:
Automated Reasoning (IJCAR 2001)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 2083))

Included in the following conference series:

  • 793 Accesses

Abstract

A simple decision deductive-based procedure for the so- called clausal miniscoped fragment of a first-order linear temporal logic with temporal operators Next and Always is presented. The soundness and completeness of the proposed decision procedure is proved.

Acknowledgements

I am greatly indebted to Professor M.Fisher and Dr. A. Degtiarev for their useful scientific discussions and remarks during my fellowship (May-July, 2000) at Manchester Metropolitan University. I would like to thank also the anonymous reviewers for helpful comments.

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.

Similar content being viewed by others

References

  1. M. Fisher, A resolution method for temporal logic, Proc. of the IJCAI, Sydney, 99–104 (1991).

    Google Scholar 

  2. M. Fisher, A normal form for temporal logics and its applications in theorem proving and execution, Journal of Logic and Computation, 7(4), 429–456 (1997).

    Article  MathSciNet  MATH  Google Scholar 

  3. M. Fisher, C. Dixon, and M. Peim, Clausal temporal resolution (To appear in: ACM Transactions on Computational Logic).

    Google Scholar 

  4. I. Hodkinson, F. Wolter, Zakharyaschev M.: Decidable fragments of first-order temporal logics. (To appear in: Annals of Pure and Applied Logic).

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

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

    MATH  Google Scholar 

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

    MathSciNet  MATH  Google Scholar 

  8. R. Pliuškevičius, On ω-decidable and decidable deductive procedures for a restricted FTL with Unless, Proc. of FTP (2000) 194–205, St. Andrews, UK.

    Google Scholar 

  9. R. Pliuškevičius, A deductive decision procedure for a restricted FTL. Abstracts of Seventh Workshop on Automated Reasoning (2000), London.

    Google Scholar 

  10. R. Pliuškevičius, On an ω-decidable deductive procedure for non-Horn sequents of a restricted FTL, LNAI 1861, 523–537 (2000).

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  12. A. Szalas, A complete axiomatic characterization of first-order temporal logic of linear time, Theoretical Comput. Sci. 54 (1987) 199–214.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Mathematics and Informatics, Akademijos 4, Vilnius, 2600, 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

Editors and Affiliations

  1. Automated Reasoning Project and Department of Computer Science, Australian National University, Canberra, ACT, 0200, Australia

    Rajeev Goré

  2. AG Theoretische Informatik und Logik, Institut für Computersprachen, Technische Universität Wien, Favoritenstr. 9, E185-2, 1040, Wien, Austria

    Alexander Leitsch

  3. Institut für Informatik, Technische Universität München, 80290, München, Germany

    Tobias Nipkow

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Pliuškevičius, R. (2001). Deduction-Based Decision Procedure for a Clausal Miniscoped Fragment of FTL. In: Goré, R., Leitsch, A., Nipkow, T. (eds) Automated Reasoning. IJCAR 2001. Lecture Notes in Computer Science, vol 2083. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45744-5_9

Download citation

  • DOI: https://doi.org/10.1007/3-540-45744-5_9

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42254-9

  • Online ISBN: 978-3-540-45744-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics