TempLog(ID:1369/tem002)

A clausal subset of first-order temporal logic, with discrete time.
References:
  • Abadi, M. and Manna, Z. "Nonclausal temporal deduction" pp1-15 view details
          in Parikh, R. editor, Proceedings of Conference on Logics of Programs, LNCS 193, Springer-Verlag, 1985 view details
  • Abadi M. and Manna, Z. "Temporal Logic in Programming", pp4-16 view details
          in Proc. of the 1987 Symposium on Logic Programming, San Fransisco, Calif, 1987. IEEE Computer Society Press. view details
  • Baudinet, M. "On the semantics of temporal logic programming" Technical Report STAN-CS-88-1203, Computer Science Department, Stanford University, Stanford, Calif, June 1988 view details
          in Proc. of the 1987 Symposium on Logic Programming, San Fransisco, Calif, 1987. IEEE Computer Society Press. view details
  • Abadi, M. and Manna, Z. "Temporal logic programming" pp277-295 view details
          in Journal of Symbolic Computation, 8, 1989 view details
  • Baudinet, M. "Logic Programming Semantics: Techniques and Applications", PhD Thesis, Department of Computer Science, Stanford University, 1989 view details
          in Journal of Symbolic Computation, 8, 1989 view details
  • Baudinet, M. "Temporal logic programming is complete and expressive" pp267-280 view details
          in Conference Record of the Sixteenth ACM Symposium on Principles of Programming Languages, pp. 267-280, Austin, Texas, Jan. 1989 view details
  • Brzoska, C. "Temporal logic programming and its relation to constraint logic programming" pp661-677 view details
          in Logic Programming: Proceedings of the 1991 International Logic Programming Symposium. MIT Press, 1991 view details
  • Baudinet, M. "A simple proof of the completeness of temporal logic programming" in L. Farinas del Cerro and M. Pentto-nen, editors, Intensional Logics for Programming, pp. 51-83. Oxford University Press, 1992 view details
          in Logic Programming: Proceedings of the 1991 International Logic Programming Symposium. MIT Press, 1991 view details
  • Orgun, Mehmet A. "Temporal and Modal Logic Programming: An Annotated Bibliography" SIGART Bulletin 1994 view details Extract: TempLog
    Abadi and Manna proposed a temporal extension of logic programming, called Templog. It uses a discrete linear-time axis with an unbounded future based on the set of natural numbers. Templog adopts the syntax of Prolog, except that it has three temporal operators: (the next moment in time), (from now on), and (sometime in the future). There are certain restrictions on Templog programs: inonotonic formulas are allowed in the bodies of program clauses, but cannot appear in the bodies of program clauses, while cannot appear in the heads. The operational semantics of Templog is given in terms of a resolution-type proof procedure, called TSLD-resolution, which is based on a restricted form of a non-clausal temporal deduction system outlined in Abadi and Manna.
          in Logic Programming: Proceedings of the 1991 International Logic Programming Symposium. MIT Press, 1991 view details