The 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. I...

Abstract An investor–State tribunal formed under a bilateral investment treaty (BIT) may be called upon to determine its jurisdiction ratione temporis based on various ‘critical dates’ such as: the date of entry into force BIT; when was made; investor acquired requisite nationality; alleged breach; first knowledge breach and loss; and/or dispute arose. When confronted with temporal issues, trib...

In developing these techniques, temporal proof is often required, and we base our work on practical proof techniques for the clausal resolution method for propositional linear-time temporal logic PLTL. The method is based on an intuitive clausal form, called SNF, comprising three main clause types and a small number of resolution rules [11, 14]. While the approach has been shown to be competiti...