Search strategies for resolution in CTL-type logics: extension and complexity

A clausal resolution approach originally developed for the branching logic CTL has recently been extended to the logics ECTL and ECTL/sup +/. In the application of the resolution rules searching for a loop is essential. In this paper, we define a depth-first technique to complement the existing breadth-first search and provide the complexity analysis of the developed methods. Additionally, it contains a correction in our previous presentation of loops.