Clausal Temporal Resolution
| dc.creator | Fisher, Michael | |
| dc.creator | Dixon, Clare | |
| dc.creator | Peim, Martin | |
| dc.date | 1999-07-21 | |
| dc.date | 2000-04-14 | |
| dc.date.accessioned | 2026-07-07T03:24:15Z | |
| dc.date.available | 2026-07-07T03:24:15Z | |
| dc.description | 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 future developments concerning this work. | |
| dc.description | 35 pages, 0 figures Expanded related work, corrected typos, expanded proofs | |
| dc.identifier | https://arxiv.org/abs/cs/9907032 | |
| dc.identifier | http://arxiv.org/abs/cs/9907032 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/33254 | |
| dc.subject | Logic in Computer Science | |
| dc.subject | Artificial Intelligence | |
| dc.subject | I.2.3;F.4.1 | |
| dc.title | Clausal Temporal Resolution | |
| dc.type | text |