Tech Reports


First-order Resolution for CTL

Lan Zhang, Ullrich Hustadt and Clare Dixon


In this paper, we describe an approach to theorem proving in Computational Tree Logic (CTL) which utilises classical first-order resolution techniques. Since there already exist a lot of well-developed first-order logic theorem provers, reusing those techniques provides great benefit for solving other similar problems. We do not attempt to prove CTL theorems directly within the temporal logic syntax. We first translate arbitrary CTL formulae into a normal form for CTL and then implement the CTL calculus using resolution in first-order logic. After that, we utilise an efficient first-order logic theorem prover, for example, VAMPIRE or SPASS to carry out proof. Further, this approach has the potential to be extended to solve problems in other logics.

[Full Paper]