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

Basukoski, Artie and Bolotov, Alexander (2005) Search strategies for resolution in CTL-type logics: extension and complexity. In: 12th International Symposium on Temporal Representation and Reasoning, 2005: TIME 2005. IEEE Computer Society, Los Alamitos, USA, pp. 195-197. ISBN 0769523706

[img]
Preview
PDF
Basukoski_Bolotov_2005_final.pdf

Download (254kB)
Official URL: http://dx.doi.org/10.1109/TIME.2005.32

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.

Item Type: Book Section
Subjects: University of Westminster > Science and Technology > Electronics and Computer Science, School of (No longer in use)
Depositing User: Miss Nina Watts
Date Deposited: 04 May 2006
Last Modified: 11 Aug 2010 14:30
URI: http://westminsterresearch.wmin.ac.uk/id/eprint/1453

Actions (login required)

Edit Item (Repository staff only) Edit Item (Repository staff only)

Downloads