Nonclausal temporal deduction
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.
KeywordsInductive Hypothesis Temporal Logic Basic Rule Proof System Linear Temporal Logic
Unable to display preview. Download preview PDF.
- [C]Cavalli, A., “A method of automatic proof for the specification and verification of protocols,” ACM SIGCOMM 84 Symposium, Montreal, Canada, 1984.Google Scholar
- [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
- [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
- [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
- [H75]Huet, G. P., “A unification algorithm for typed λ-calculus,” Theoretical Computer Science, Vol. 1, No. 1, pp. 27–57.Google Scholar
- [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
- [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
- [M]Murray, N. V., “Completely nonclausal theorem proving,” Artificial Intelligence, Vol. 18, No. 1, pp. 67–85, January 1982.Google Scholar
- [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
- [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