The Clausal Resolution method initially proposed by Robinson has been extended to the linear time logic PLTL, and the branching time logics CTL, ECTL and most recently ECTL+. In this paper we provide an overview of the resolution method for ECTL+, and present a complexity analysis for the overall method.

Several forms of iterable belief change exist, differing in the kind and its strength: some operators introduce formulae, others remove them; add formulae unconditionally, only as additions to previous beliefs; relative current situation, all possible cases. A sequence changes may involve several them: for example, first step is a revision, second contraction third refinement beliefs. The ten c...

Graphs have so many applications in real world problems. When we deal with huge volume of data, analyzing data is difficult or sometimes impossible. In big data problems, clustering data is a useful tool for data analysis. Singular value decomposition(SVD) is one of the best algorithms for clustering graph but we do not have any choice to select the number of clusters and the number of members ...