Provenance and Temporally Annotated Logic Programming

Abstract

Abstract-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.

Temporally Annotated Extended Logic Programs

“…In [15], we presented semantics for provenance and temporally annotated definite logic programs. However, [15] does not consider strong and weak negation, and reasons based on temporal intervals and not time points.…”

“…However, [15] does not consider strong and weak negation, and reasons based on temporal intervals and not time points. The query language presented here is a restriction of the query language presented in [15] on the temporal component, with the difference that negated atoms in the queries are supported in the present work.…”