Efficiently executable temporal logic programs

Stephan Merz

Abstract

We identify a subset of first-order LTL (temporal logic of linear time) that lends itself to efficient model construction and could therefore serve as the basis of a temporal logic programming language.

Note

This paper contains the main results of my Ph.D. thesis in concise form.

Available as:  gzip'ed Postscript 

Reference

@InProceedings{merz:efficiently,
  author =    "Stephan Merz",
  title =     "Efficiently Executable Temporal Logic Programs",
  editor =    "M. Fisher and R. Owens",
  volume =    897,
  series =    "Lecture Notes in Computer Science",
  pages =     "69--85",
  booktitle = "Executable Modal and Temporal Logics",
  year =      1995,
  publisher = "Springer-Verlag",
  address =   "Chamb{\'e}ry, France"
}