Skip to main content
SpringerLink
Log in

Automated theorem proving in temporal logic: T-resolution

  • Published:
Journal of Computer Science and Technology Aims and scope Submit manuscript

Abstract

This paper presentes a novel resolution method, T-resolution, based on the first order temporal logic. The primary claim of this method is its soundness and completeness. For this purpose, we construct the corresponding semantic tress and extend Herbrand's Theorem.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Chang Chin-liang, Richard Char-tung Lee. Symbolic logic and mechanical theorem proving. Academic Press, 1973.

  2. Abadi M, Manna Z. A timely resolution. Symposium on Logic in Computer Science. 1986, 176–186.

  3. Allen J F. Maintaining knowledge about temporal intervals. Communication of ACM, 1983, 26: 832–843.

    Article  MATH  Google Scholar 

  4. Gallaire H, Minker J, Nicolas J-M. Logic and databases: A deductive approach. ACM computing surveys. 1984, 16(2): 153–185.

    Article  MATH  MathSciNet  Google Scholar 

  5. Shoham Y. Temporal logics in AI: Semantical and ontological considerations. Artificial Intelligence. 1987, 33: 89–104.

    Article  MATH  MathSciNet  Google Scholar 

  6. Shoham Y. Reasoning about Change. The MIT Press, 1988, 30–70.

  7. McDermott D, Doyle J. Non-monotonic logic I. Artificial Intelligence. 1980, 13: 41–72.

    Article  MATH  MathSciNet  Google Scholar 

  8. Dean T, McDermott D. Temporal data base management. Artificial Intelligence. 1987, 32: 1–55.

    Article  Google Scholar 

  9. Qian W, Zhao Z K. Temporal reasoning management with non-monotonicity. In: Information Processing 89, Ritter G X (ed.), 1989, 667–672.

  10. Qian W, Zhao Z K. Reasoning by RAE tree. Proceedings of the Third Asia Mathematical. Logic Conference, Nov. 1987, Beijing.

  11. Qian W. On the study of temporal reasoning databases. M. S. Thesis, Dept. of Computer Science, Fudan Univ., 1989 (in Chinese).

  12. Chen W D, Zhao Z K. A temporal logic based-on time interval and its applications. The Third National Symp. on Knowledge Engineering, 1990, 107–114 (in Chinese).

  13. Chen W D. Integrity constraints on temporal deductive databases. M. S. Thesis, Dept. of Computer Science, Fudan Univ., 1991 (in Chinese).

  14. Zhang K, Zhao Z K. A temporal knowledge deductive system. ICYCS'91, July 18–20, 1991, Beijing.

  15. Qian W, Zhao Z K. Temporal reasoning in data base. In: Artificial Intelligence in Databases and Information Systems (DS-3), Meersman R A (ed.), North-Holland, 1990, 223–232.

  16. Wolper P L. Synthesis of communicating processes from temporal logic specifications. Report No. STANCS-82-925, Dept. of Computer Science, Stanford Univ., Aug. 1982.

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Fudan University, 200433, Shanghai

    Zhaokeng Zhao, Jun Dai & Wendan Chen

Authors
  1. Zhaokeng Zhao
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jun Dai
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Wendan Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

This work is supported by the National Natural Science Foundation under grant number 68975015.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zhao, Z., Dai, J. & Chen, W. Automated theorem proving in temporal logic: T-resolution. J. of Compt. Sci. & Technol. 9, 53–62 (1994). https://doi.org/10.1007/BF02939486

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02939486

Keywords

Search

Navigation