Abstract

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.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.