Copyright Statement: This is an open access article licensed under a Creative Commons Attribution 4.0 International License, which permits unrestricted use, distribution, and reproduction in any medium, even commercially as long as the original work is properly cited.
Digital Object Identifier (DOI) : 10.14569/IJARAI.2012.010703
Article Published in International Journal of Advanced Research in Artificial Intelligence(IJARAI), Volume 1 Issue 7, 2012.
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.
Anastasia Analyti and Ioannis Pachoulakis, “Provenance and Temporally Annotated Logic Programming” International Journal of Advanced Research in Artificial Intelligence(IJARAI), 1(7), 2012. http://dx.doi.org/10.14569/IJARAI.2012.010703