The branching-time temporal logic ECTL + is strictly more expressive than ECTL, in allowing Boolean combinations of fairness operators and single temporal operators. We show that the key elements of the resolution method previously defined for a weaker logic, ECTL, namely the clausal normal form, the concepts of step resolution and a temporal resolution, are applicable in this new framework of ECTL +. We show that any ECTL + formula can be translated into its normal form using the technique previously defined for the logic ECTL. This enables us to apply to the generated set of clauses a resolution technique originally defined for the basic computation tree logic CTL.
To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.