Skip to main content
SpringerLink
Log in

Towards First-Order Temporal Resolution

  • Conference paper
  • First Online:
KI 2001: Advances in Artificial Intelligence (KI 2001)

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

Included in the following conference series:

Abstract

In this paper we show how to extend clausal temporal resolution to the ground eventuality fragment of monodic first-order temporal logic, which has recently been introduced by Hodkinson, Wolter and Zakharyaschev. While a finite Hilbert-like axiomatization of complete monodic first order temporal logic was developed by Wolter and Zakharyaschev, we propose a temporal resolutionbased proof system which reduces the satisfiability problem for ground eventuality monodic first-order temporal formulae to the satisfiability problem for formulae of classical first-order logic.

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. S. Abiteboul, V. Vianu, B. Fordham, and Y. Yesha. Relational transducers for electronic commerce. In Proceedings of 17th Symposium on Database Systems (PODS’1998), pages 179–187. ACM Press, 2000.

    Google Scholar 

  2. L. Bachmair and H. Ganzinger. Resolution theorem proving. In A. Robinson and A. Voronkov, editors, Handbook of Automated Reasoning, volume 1, pages 19–100. Elsevier Science and MIT Press, 2001.

    Google Scholar 

  3. E. Börger, E. Grôdel, and Yu. Gurevich. The Classical Decision Problem. Springer Verlag, 1997.

    Google Scholar 

  4. A. Degtyarev and M. Fisher. Propositional temporal resolution revised. In H.J. Ohlbach, editor, Proc. of 7th UK Workshop on Automated Reasoning (ARW’00), London, U.K., June 2000.

    Google Scholar 

  5. M. Fisher, C. Dixon, and M. Peim. Clausal temporal resolution. ACM Transactions on Computation Logic, 2(1), January 2001.

    Google Scholar 

  6. M. Fisher. A resolution method for temporal logic. In Proceedings of the Twelfth International Joint Conference on Artificial Intelligence (IJCAI’91), 1991.

    Google Scholar 

  7. M. Fisher. A normal form for first-order temporal formulae. In D. Kapur, editor, 11 th International Conference on Automated Deduction, volume 607 of Lecture Notes in Artificial Intelligence, Saratoga Springs, USA, 1992. Springer Verlag.

    Google Scholar 

  8. M. Fisher. Anormal form for temporal logics and its applications in theorem-proving and execution. Journal of Logic and Computation, 7(4), 1997.

    Google Scholar 

  9. C.G. Fermüller, A. Leitsch, U. Hustadt, and T. Tammet. Resolution decision procedures. In A. Robinson and A. Voronkov, editors, Handbook of Automated Reasoning, volume 2, pages 1791–1852. Elsevier Science and MIT Press, 2001.

    Google Scholar 

  10. D. Gabbay. Declarative past and imperative future:executive temporal logic for interactive systems. In B. Banieqbal, H. Barringer, and A. Pnueli, editors, Proceedings on Colloquium on Temporal Logic and Specification, volume 398 of Lecture Notes in Computer Science, pages 402–450, Altrincham, U.K., 1987. Springer Verlag.

    Google Scholar 

  11. I. Hodkinson, F. Wolter, and M. Zakharyaschev. Fragments of first-order temporal logics. Annals of Pure and Applied logic, 106:85–134, 2000.

    Article  MATH  MathSciNet  Google Scholar 

  12. D.A. Plaisted and S.A. Greenbaum. A structure-preserving clause form transformation. Journal of Symbolic Computation, 2(3):293–304, September 1986.

    Article  MATH  MathSciNet  Google Scholar 

  13. M. Spielmann. Verification of relational transducers for electronic commerce. In Proceedings of 19th Symposium on Database Systems (PODS’2000), pages 92–103, Dallas, Texas, 2000. ACM Press.

    Google Scholar 

  14. A. Szalas. Concerning the semantic consequence relation in first-order temporal logic. Theoretical Computer Science, 47:329–334, 1986.

    Article  MATH  MathSciNet  Google Scholar 

  15. P. Wolper. Syshthesis of Communicating Processes from Temporal Logic Specifications. Ph.d. dissertation, Stanford University, 1982.

    Google Scholar 

  16. M. Wolter, F. and. Z Akharyaschev. Spatio-temporal representation and reasoning based on RCC-8. In Proceedings of the 7th Conference on Principles of Knowledge Representation and Reasoning (KR’2000), pages 3–14, Montreal, Canada, 2000.

    Google Scholar 

  17. F. Wolter and M. Zakharyaschev. Axiomatizing the monodic fragment of first-order temporal logic. To appear in Annals of Pure and Applied logic., 2001.

    Google Scholar 

  18. ]_ N. Zamov. The resolution method without skolemization. Soviet Mathematical Doklady, 293(5):1046–1049, 1987.

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Logic and Computation Group, Department of Computer Science, University of Liverpool, Liverpool, L69 7ZF, UK

    Anatoli Degtyarev & Michael Fisher

Authors
  1. Anatoli Degtyarev
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Michael Fisher
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. RWTH Aachen, Theoretical Computer Science, Ahornstrasse 55, 52074, Aachen, Germany

    Franz Baader

  2. Intelligent Systems Department, University of Leipzig, Computer Science Institute, Augustusplatz 10-11, 04109, Leipzig, Germany

    Gerhard Brewka

  3. Institute of Information Systems Knowledge-Based Systems Group, Vienna University of Technology, Favoritenstrasse 11, 1040, Wien, Austria

    Thomas Eiter

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Degtyarev, A., Fisher, M. (2001). Towards First-Order Temporal Resolution. In: Baader, F., Brewka, G., Eiter, T. (eds) KI 2001: Advances in Artificial Intelligence. KI 2001. Lecture Notes in Computer Science(), vol 2174. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45422-5_3

Download citation

  • DOI: https://doi.org/10.1007/3-540-45422-5_3

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-45422-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation