Skip to main content
SpringerLink
Log in

Search strategies for resolution in temporal logics

  • Session 9A
  • Conference paper
  • First Online:
Automated Deduction — Cade-13 (CADE 1996)

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

Included in the following conference series:

Abstract

In this paper we give and evaluate the algorithms for a fully automated temporal resolution theorem prover. An approach to applying resolution, a proof method for classical logics suited to mechanisation, to temporal logics has been developed by Fisher. As the application of the temporal resolution rule is the most costly part of the method, involving search amongst graphs, we propose different algorithms on which to base an implementation. The paper concludes with a comparison of their performance.

This work was supported partially by an EPSRC PhD Studentship and partially by EPSRC Research Grant GR/K57282

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. M. Abadi and Z. Manna. Nonclausal Deduction in First-Order Temporal Logic. ACM Journal, 37(2):279–317, April 1990.

    Article  Google Scholar 

  2. A. Cavalli and L. Fariñas del Cerro. A Decision Method for Linear Temporal Logic. In R. E. Shostak, editor, Proceedings of the 7th International Conference on Automated Deduction, volume 170 of Lecture Notes in Computer Science, pages 113–127. Springer-Verlag, 1984.

    Google Scholar 

  3. C. Dixon, M. Fisher, and H. Barringer. A Graph-Based Approach to Resolution in Temporal Logic. In Temporal Logic, First International Conference, ICTL '94, Proceedings, volume 827 of Lecture Notes in Artificial Intelligence, Bonn, Germany, July 1994. Springer-Verlag.

    Google Scholar 

  4. C. Dixon. Strategies for Temporal Resolution. PhD thesis, Department of Computer Science, University of Manchester, 1995.

    Google Scholar 

  5. C. Dixon. Temporal Resolution: A Breadth-First Search Approach. In Proceedings of TIME-96 the Third International Workshop on Temporal Representation and Reasoning, Key West, Florida, May 1996.

    Google Scholar 

  6. M. Fisher. A Resolution Method for Temporal Logic. In Proceedings of the Twelfth International Joint Conference on Artificial Intelligence (IJCAI), Sydney, Australia, August 1991. Morgan Kaufman.

    Google Scholar 

  7. M. Fisher. A Normal Form for First-Order Temporal Formulae. In Proceedings of Eleventh International Conference on Automated Deduction (CADE), volume 607 of Lecture Notes in Computer Science, Saratoga Springs, New York, June 1992. Springer-Verlag.

    Google Scholar 

  8. G. D. Gough. Decision Procedures for Temporal Logic. Master's thesis, Department of Computer Science, University of Manchester, October 1984. Also University of Manchester, Department of Computer Science, Technical Report UMCS-89-10-1.

    Google Scholar 

  9. D. Gabbay, A. Pnueli, S. Shelah, and J. Stavi. The Temporal Analysis of Fairness. In Proceedings of the Seventh ACM Symposium on the Principles of Programming Languages, pages 163–173, Las Vegas, Nevada, January 1980.

    Google Scholar 

  10. B. T. Hailpern. Verifying Concurrent Processes Using Temporal Logic, volume 129 of Lecture Notes in Computer Science. Springer-Verlag, 1982.

    Google Scholar 

  11. L. Lamport. Specifying Concurrent Program Modules. ACM Transactions on Programming Languages and Systems, 5(2):190–222, April 1983.

    Article  Google Scholar 

  12. Z. Manna and A. Pnueli. The Temporal Logic of Reactive and Concurrent Systems: Specification. Springer-Verlag, New York, 1992.

    Google Scholar 

  13. M. Peim. Propositional Temporal Resolution Over Labelled Transition Systems. Unpublished Technical Note, Department of Computer Science, University of Manchester, 1994.

    Google Scholar 

  14. G. L. Peterson. Myths about the Mutual Exclusion Problem. Information Processing Letters, 12(3):115–116, 1981.

    Article  Google Scholar 

  15. A. Pnueli. In Transition From Global to Modular Temporal Reasoning about Programs. In Krysztof Apt, editor, Logics and Models of Concurrent Systems, pages 123–144, La Colle-sur-Loup, France, October 1984. NATO, Springer-Verlag.

    Google Scholar 

  16. J. A. Robinson. A Machine-Oriented Logic Based on the Resolution Principle. ACM Journal, 12(1):23–41, January 1965.

    Article  Google Scholar 

  17. A. P. Sistla and E. M. Clarke. Complexity of Propositional Linear Temporal Logics. ACM Journal, 32(3):733–749, July 1985.

    Article  Google Scholar 

  18. G. Venkatesh. A Decision Method for Temporal Logic based on Resolution. Lecture Notes in Computer Science, 206:272–289, 1986.

    Google Scholar 

  19. M. Y. Vardi and P. Wolper. An Automata-Theoretic Approach to Automatic Program Verification. In Proceedings IEEE Symposium on Logic in Computer Science, pages 332–344, Cambridge, 1986.

    Google Scholar 

  20. P. Wolper. The Tableau Method for Temporal Logic: An overview. Logique et Analyse, 110–111:119–136, June–Sept 1985.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computing, Manchester Metropolitan University, M1 5GD, Manchester, UK

    Clare Dixon

Authors
  1. Clare Dixon
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

M. A. McRobbie J. K. Slaney

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dixon, C. (1996). Search strategies for resolution in temporal logics. In: McRobbie, M.A., Slaney, J.K. (eds) Automated Deduction — Cade-13. CADE 1996. Lecture Notes in Computer Science, vol 1104. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61511-3_121

Download citation

  • DOI: https://doi.org/10.1007/3-540-61511-3_121

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-61511-8

  • Online ISBN: 978-3-540-68687-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation