Add to ORKGThe clausal resolution method developed for discrete temporal logics involves translation to a normal form, classical resolution on formulae within states (termed step resolution) and temporal resolution between states. Step resolution may generate an unnecessarily large set of clauses. In addition, the most expensive part of the method is the application of the temporal resolution operation
We present a clausal resolution-based method for temporal logics of knowledge with synchrony and no...
We expand the applicability of the clausal resolution technique to the branching-time temporal logi...
Computation Tree Logic (CTL) is a branching-time temporal logic whose underlying model of time is a ...
AbstractA temporal clausal resolution method was originally developed for linear time temporal logic...
Abstract First-order temporal logic is a concise and powerful notation, withmany potential applicati...
SIGLEAvailable from British Library Document Supply Centre-DSC:DXN032890 / BLDSC - British Library D...
AbstractFirst-order temporal logic is a concise and powerful notation, with many potential applicati...
A resolution based proof system for a Temporal Logic of Possible Belief is presented. This logic is ...
The increasing interest in applying temporal logics in various areas of computer science requires th...
AbstractA resolution based proof system for a Temporal Logic of Possible Belief is presented. This l...
Abstract. In this paper, we show how the clausal temporal resolution technique developed for tempora...
The branching-time temporal logic CTL is useful for specifying systems that change over time and inv...
In this paper a technique is presented which provides us with a means to develop resolution-based ca...
The aim of this thesis is to explore the potential of resolution-based methods for linear temporal r...
The increasing interest in applying temporal logics in various areas of computer science requires th...
We present a clausal resolution-based method for temporal logics of knowledge with synchrony and no...
We expand the applicability of the clausal resolution technique to the branching-time temporal logi...
Computation Tree Logic (CTL) is a branching-time temporal logic whose underlying model of time is a ...
AbstractA temporal clausal resolution method was originally developed for linear time temporal logic...
Abstract First-order temporal logic is a concise and powerful notation, withmany potential applicati...
SIGLEAvailable from British Library Document Supply Centre-DSC:DXN032890 / BLDSC - British Library D...
AbstractFirst-order temporal logic is a concise and powerful notation, with many potential applicati...
A resolution based proof system for a Temporal Logic of Possible Belief is presented. This logic is ...
The increasing interest in applying temporal logics in various areas of computer science requires th...
AbstractA resolution based proof system for a Temporal Logic of Possible Belief is presented. This l...
Abstract. In this paper, we show how the clausal temporal resolution technique developed for tempora...
The branching-time temporal logic CTL is useful for specifying systems that change over time and inv...
In this paper a technique is presented which provides us with a means to develop resolution-based ca...
The aim of this thesis is to explore the potential of resolution-based methods for linear temporal r...
The increasing interest in applying temporal logics in various areas of computer science requires th...
We present a clausal resolution-based method for temporal logics of knowledge with synchrony and no...
We expand the applicability of the clausal resolution technique to the branching-time temporal logi...
Computation Tree Logic (CTL) is a branching-time temporal logic whose underlying model of time is a ...