Nonclausal temporal deduction

  • Martin Abadi
  • Zohar Manna
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 193)


We present a proof system for propositional temporal logic. This system is based on nonclausal resolution; proofs are natural and generally short. Its extension to first-order temporal logic is considered.

Two variants of the system are described. The first one is for a logic with □ (“always”), ◊ (“sometime”), and ○ (“next”). The second variant is an extension of the first one to a logic with the additional operators U (“until”) and P (“precedes”). Each of these variants is proved complete.


Inductive Hypothesis Temporal Logic Basic Rule Proof System Linear Temporal Logic 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [C]
    Cavalli, A., “A method of automatic proof for the specification and verification of protocols,” ACM SIGCOMM 84 Symposium, Montreal, Canada, 1984.Google Scholar
  2. [CF]
    Cavalli, A., and L. Fariñas del Cerro, “A decision method for linear temporal logic,” Seventh Conference on Automated Deduction, Napa, CA, May 1984, pp. 113–127.Google Scholar
  3. [GPSS]
    Gabbay, D., A. Pnueli, S. Shelah and J. Stavi, “The temporal analysis of fairness,” Seventh ACM Symposium on Principles of Programming Languages, Las Vegas, NV, January 1980, pp. 163–173.Google Scholar
  4. [H72]
    Huet, G. P., “Constrained resolution: a complete method for higher order logic,” Ph.D. Thesis, Case Western University, Jennings Computing Center Report 1117, August 1972.Google Scholar
  5. [H75]
    Huet, G. P., “A unification algorithm for typed λ-calculus,” Theoretical Computer Science, Vol. 1, No. 1, pp. 27–57.Google Scholar
  6. [MP]
    Manna, Z. and A. Pnueli, “Verification of concurrent programs: The temporal framework,” in The Correctness Problem in Computer Science (R.S. Boyer and J S. Moore, eds.), International Lecture Series in Computer Science, Academic Press, London, 1982, pp. 215–273.Google Scholar
  7. [MW]
    Manna, Z. and R. Waldinger, “A deductive approach to program synthesis,” ACM Transactions on Programming Languages and Systems, Vol. 2, No. 1, January 1980, pp. 92–121.Google Scholar
  8. [M]
    Murray, N. V., “Completely nonclausal theorem proving,” Artificial Intelligence, Vol. 18, No. 1, pp. 67–85, January 1982.Google Scholar
  9. [R]
    J. A. Robinson, “A machine-oriented logic based on the resolution principle,” Journal of the ACM, Vol. 12, No. 1, January 1965, pp. 23–41.Google Scholar
  10. [W]
    Wolper, P., “Temporal logic can be more expressive,” Proc. 22nd IEEE Symp. on Foundations of Computer Science, Nashville, 1981, pp. 340–348.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1985

Authors and Affiliations

  • Martin Abadi
    • 1
  • Zohar Manna
    • 1
  1. 1.Computer Science DepartmentStanford UniversityUSA

Personalised recommendations