The Community for Technology Leaders
Temporal Representation and Reasoning, International Syposium on (2005)
Burlington, Vermont
June 23, 2005 to June 25, 2005
ISSN: 1530-1311
ISBN: 0-7695-2370-6
pp: 195-197
Artie Basukoski , University of Westminster
Alexander Bolotov , University of Westminster
ABSTRACT
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.
INDEX TERMS
null
CITATION
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
93 ms
(Ver 3.3 (11022016))