Temporal Representation and Reasoning, International Syposium on (2005)
June 23, 2005 to June 25, 2005
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TIME.2005.32
Artie Basukoski , University of Westminster
Alexander Bolotov , University of Westminster
A clausal resolution approach originally developed for the branching logic CTL has recently been extended to the logics ECTL and ECTL+. 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.
Artie Basukoski, Alexander Bolotov, "Search Strategies for Resolution in CTL-Type Logics: Extension and Complexity", Temporal Representation and Reasoning, International Syposium on, vol. 00, no. , pp. 195-197, 2005, doi:10.1109/TIME.2005.32