We are not able to resolve this OAI Identifier to the repository landing page. If you are the repository manager for this record, please head to the Dashboard and adjust the settings.
'Institute of Electrical and Electronics Engineers (IEEE)'
Abstract
A temporal clausal resolution method was originally
developed for linear time temporal logic and further extended to the branching-time framework of Computation Tree Logic (CTL). In this paper, following our general idea
to expand the applicability of this efficient method to more
expressive formalisms useful in a variety of applications
in computer science and AI requiring branching time logics,
we define a clausal resolution technique for Extended
Computation Tree Logic (ECTL). The branching-time temporal
logic ECTL is strictly more expressive than CTL, in
allowing fairness operators. The key elements of the resolution method for ECTL, namely the clausal normal form, the concepts of step resolution and a temporal resolution,
are introduced and justified with respect to this new framework.
Although in developing these components we incorporate
many of the techniques defined for CTL, we need novel mechanisms in order to capture fairness together with the limit closure property of the underlying tree models.
We accompany our presentation of the relevant techniques
by examples of the application of the temporal resolution
method. Finally, we provide a correctness argument and
consider future work discussing an extension of the method
yet further, to the logic CTL*, the most powerful logic of
this class
Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.