Logical foundations for more expressive declarative temporal logic programming languages

  • Authors:
  • Jose Gaintzarain;Paqui Lucio

  • Affiliations:
  • University of the Basque Country, Bilbao, Spain;University of the Basque Country, San Sebastian, Spain

  • Venue:
  • ACM Transactions on Computational Logic (TOCL)
  • Year:
  • 2013

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this article, we present a declarative propositional temporal logic programming language called TeDiLog that is a combination of the temporal and disjunctive paradigms in logic programming. TeDiLog is, syntactically, a sublanguage of the well-known Propositional Linear-time Temporal Logic (PLTL). TeDiLog allows both eventualities and always-formulas to occur in clause heads and also in clause bodies. To the best of our knowledge, TeDiLog is the first declarative temporal logic programming language that achieves this high degree of expressiveness. We establish the logical foundations of our proposal by formally defining operational and logical semantics for TeDiLog and by proving their equivalence. The operational semantics of TeDiLog relies on a restriction of the invariant-free temporal resolution procedure for PLTL that was introduced by Gaintzarain et al. in [2013]. We define a fixpoint semantics that captures the reverse (bottom-up) operational mechanism and prove its equivalence with the logical semantics. We also provide illustrative examples and comparison with other proposals.