Clausal Temporal Resolution

Preprint
Publisher Website
Google Scholar
  • 21 July 1999
Abstract
In this article, we examine how clausal resolution can be applied to a specific, but widely used, non-classical logic, namely discrete linear temporal logic. Thus, we first define a normal form for temporal formulae and show how arbitrary temporal formulae can be translated into the normal form, while preserving satisfiability. We then introduce novel resolution rules that can be applied to formulae in this normal form, provide a range of examples and examine the correctness and complexity of this approach is examined and. This clausal resolution approach. Finally, we describe related work and show how the method presented in this paper is being used as the basis for practical temporal theorem-proving tools.

This publication has 0 references indexed in Scilit: