Skip to main content
SpringerLink
Log in
SpringerLink
Log in

TRP++ 2.0: A Temporal Resolution Prover

  • Conference paper
Automated Deduction – CADE-19 (CADE 2003)

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

Included in the following conference series:

Abstract

Temporal logics are extensions of classical logic with operators that deal with time. They have been used in a wide variety of areas within Computer Science and Artificial Intelligence, for example robotics [14], databases [15], hardware verification [8] and agent-based systems [12].

Work supported by EPSRC grant GR/L87491.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bentley, J., Sedgewick, R.: Fast algorithms for sorting and searching strings. In: SODA: ACM-SIAM Symposium on Discrete Algorithms (1997)

    Google Scholar 

  2. Dixon, C.: Search strategies for resolution in temporal logics. In: McRobbie, M.A., Slaney, J.K. (eds.) CADE 1996. LNCS (LNAI), vol. 1104, pp. 673–687. Springer, Heidelberg (1996)

    Google Scholar 

  3. Dixon, C.: Using Otter for temporal resolution. In: Advances in Temporal Logic, pp. 149–166. Kluwer Academic Publishers, Dordrecht (2000)

    Google Scholar 

  4. Emerson, E.A.: Temporal and modal logic. In: Handbook of Theoretical Computer Science, ch. 16, pp. 997–1072. Elsevier, Amsterdam (1990)

    Google Scholar 

  5. Fisher, M.: A resolution method for temporal logic. In: Proc. IJCAI 1991, pp. 99–104. Morgan Kaufmann, San Francisco (1991)

    Google Scholar 

  6. Fisher, M., Dixon, C., Peim, M.: Clausal temporal resolution. ACM Transactions on Computational Logic 2(1), 12–56 (2001)

    Article  MathSciNet  Google Scholar 

  7. Hoepman, J.-H.: Uniform deterministic self-stabilizing ring-orientation on oddlength rings. In: Tel, G., Vitányi, P.M.B. (eds.) WDAG 1994. LNCS, vol. 857, pp. 265–279. Springer, Heidelberg (1994)

    Chapter  Google Scholar 

  8. Holzmann, G.J.: The model checker Spin. IEEE Trans. on Software Engineering 23(5), 279–295 (1997)

    Article  MathSciNet  Google Scholar 

  9. Hustadt, U., Konev, B.: TRP++: A temporal resolution prover. In: Proc. WIL 2002 (2002), Available as http://www.lsi.upc.es/~roberto/wilproceedings.html

  10. Hustadt, U., Schmidt, R.A.: Scientific benchmarking with temporal logic decision procedures. In: Proc. KR 2002, pp. 533–544. Morgan Kaufmann, San Francisco (2002)

    Google Scholar 

  11. Knuth, D.E.: The Art of Computer Programming: Sorting and Searching, vol. III. Addison-Wesley, Reading (1973)

    Google Scholar 

  12. Rao, A.S., Georgeff, M.P.: Decision procedures for BDI logics. Journal of Logic and Computation 8(3), 293–343 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  13. Riazanov, A., Voronkov, A.: Limited resource strategy in resolution theorem proving. Journal of Symbolic Computation (to appear)

    Google Scholar 

  14. Shanahan, M.P.: Solving the Frame Problem. MIT Press, Cambridge (1997)

    Google Scholar 

  15. Tansel, A. (ed.): Temporal Databases: theory, design, and implementation. Benjamin/ Cummings (1993)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Liverpool, UK

    Ullrich Hustadt & Boris Konev

Authors
  1. Ullrich Hustadt
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Boris Konev
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Theoretical Computer Science, TU Dresden, Germany

    Franz Baader

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hustadt, U., Konev, B. (2003). TRP++ 2.0: A Temporal Resolution Prover. In: Baader, F. (eds) Automated Deduction – CADE-19. CADE 2003. Lecture Notes in Computer Science(), vol 2741. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45085-6_21

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-45085-6_21

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-45085-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation