Provenance and Temporally Annotated Logic Programming

In this paper, we consider provenance and temporally annotated logic rules (pt-logic rules, for short), which are definite logic programming rules associated with the name of the source that they originate and the temporal interval during which they are valid. A collection of pt-logic rules form a provenance and temporally annotated logic program P, called pt-logic program, for short. We develop a model theory for P and define its maximally temporal entailments of the form A:<S, ti>, indicating that atom A is derived from a set of sources S and holds at a maximal temporal interval ti, according to S. We define a consequence operator that derives exactly the maximally temporal entailments of P for a set of sources. We show that the complexity of the considered entailment is EXPTIME-complete.

@article{Analyti2012,
  title     = {Provenance and Temporally Annotated Logic Programming},
  journal   = {International Journal of Advanced Research in Artificial Intelligence},
  volume    = {1},
  number    = {7},
  year      = {2012},
  publisher = {The Science and Information Organization},
  author    = {Anastasia Analyti and Ioannis Pachoulakis},
  doi       = {10.14569/IJARAI.2012.010703},
  url       = {https://doi.org/10.14569/IJARAI.2012.010703}
}