A normal form for first-order temporal formulae

  • Michael Fisher
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 607)


In this paper a normal form for formulae of a first-order temporal logic is described. This normal form, called First-Order Separated Normal Form (SNFf), forms the basis of both a temporal resolution method [5] and a family of executable temporal logics [2]. A first-order temporal logic, based on a linear discrete model structure, is introduced and the procedure for transforming an arbitrary formula of this logic to SNFf is described. The transformation process not only preserves satisfiability but also ensures that any model of the transformed formula is a model of the original one. These properties ensure that the transformation into SNFf has applications in both theorem proving and execution.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    M. Abadi and Z. Manna. Nonclausal Deduction in First-Order Temporal Logic. ACM Journal, 37(2):279–317, April 1990.Google Scholar
  2. [2]
    H. Barringer, M. Fisher, D. Gabbay, G. Gough, and R. Owens. Metatem: A Framework for Programming in Temporal Logic. In REX Workshop on Stepwise Refinement of Distributed Systems: Models, Formalisms, Correctness, Mook, Netherlands, June 1989. (Published in Lecture Notes in Computer Science, volume 430, Springer Verlag).Google Scholar
  3. [3]
    T. Boy de-la Tour and G. Chaminade. The Use of Renaming to Improve the Efficiency of Clausal Theorem Proving. In Ph. Jorrand and V. Sgurev, editors, Artificial Intelligence IV: Methodology, Systems, Applications, pages 3–12. Elsevier Science Publishers B.V. (North-Holland), 1990.Google Scholar
  4. [4]
    M. Fisher and P. Noël. Transformation and Synthesis in Metatem — Part I: Prepositional Metatem. Technical Report UMCS-92-2-1, Department of Computer Science, University of Manchester, Oxford Road, Manchester M13 9PL, U.K., February 1992.Google Scholar
  5. [5]
    Michael Fisher. A Resolution Method for Temporal Logic. In J. Mylopoulos and R. Reiter, editors, Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI), Sydney, Australia, August 1991. Morgan Kaufman.Google Scholar
  6. [6]
    Andreas Nonnengart. Resolution for First-Order Linear Temporal Logics. (Draft), 1991.Google Scholar
  7. [7]
    D. A. Plaisted and S. A. Greenbaum. A Structure-Preserving Clause Form Translation. Journal of Symbolic Computation, 2(3):293–304, September 1986.Google Scholar
  8. [8]
    Pierre Wolper. Temporal Logic Can Be More Expressive. Information and Control, 56, 1983.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1992

Authors and Affiliations

  • Michael Fisher
    • 1
  1. 1.Department of Computer ScienceUniversity of ManchesterManchesterUK

Personalised recommendations