A clausal resolution method for branching-time logic ECTL+

Authors:
Alexander Bolotov;Artie Basukoski
Affiliations:
Harrow School of Computer Science, University of Westminster, Watford Road, UK HA1 3TP;Harrow School of Computer Science, University of Westminster, Watford Road, UK HA1 3TP
Venue:
Annals of Mathematics and Artificial Intelligence
Year:
2006

Citing 9
Cited 1

Decision procedures and expressiveness in the temporal logic of branching time

Journal of Computer and System Sciences
“Sometimes” and “not never” revisited: on branching versus linear time temporal logic

Journal of the ACM (JACM) - The MIT Press scientific computation series
Computation tree logic CTL* and path quantifiers in the monadic theory of the binary tree

14th International Colloquium on Automata, languages and programming
Temporal and modal logic

Handbook of theoretical computer science (vol. B)
On the relation of programs and computations to models of temporal logic

Time and logic
Automated temporal reasoning about reactive systems

Proceedings of the VIII Banff Higher order workshop conference on Logics for concurrency : structure versus automata: structure versus automata
Clausal temporal resolution

ACM Transactions on Computational Logic (TOCL)
Deciding branching time logic

STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Resolution for Branching Time Temporal Logics: Applying the Temporal Resolution Rule

TIME '00 Proceedings of the Seventh International Workshop on Temporal Representation and Reasoning (TIME'00)

One-pass tableaux for computation tree logic

LPAR'07 Proceedings of the 14th international conference on Logic for programming, artificial intelligence and reasoning

Quantified Score

Hi-index	0.00

Visualization

Abstract

We expand the applicability of the clausal resolution technique to the branching-time temporal logic ECTL+. ECTL+ is strictly more expressive than the basic computation tree logic CTL and its extension, ECTL, as it allows Boolean combinations of fairness and single temporal operators. We show how any ECTL+ formula can be translated to a normal form the structure of which was initially defined for CTL and then used for ECTL. This enables us to apply to ECTL+ a resolution technique defined over the set of clauses. Both correctness of the method and complexity of the transformation procedure are given.