Provenance and Temporally Annotated Logic Programming
Journal Title: International Journal of Advanced Research in Artificial Intelligence(IJARAI) - Year 2012, Vol 1, Issue 7
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.
Authors and Affiliations
Anastasia Analyti, Ioannis Pachoulakis
Keywords
Related Articles
- EP ID EP130196
- DOI -
- Views 120
- Downloads 0
A novel hybrid genetic differential evolution algorithm for constrained optimization problems
Most of the real-life applications have many constraints and they are considered as constrained optimization problems (COPs). In this paper, we present a new hybrid genetic differential evolution algorithm to solve...
A Multistage Feature Selection Model for Document Classification Using Information Gain and Rough Set
Huge number of documents are increasing rapidly, therefore, to organize it in digitized form text categorization becomes an challenging issue. A major issue for text categorization is its large number of features....
Clustering Web Documents based on Efficient Multi-Tire Hashing Algorithm for Mining Frequent Termsets
Document Clustering is one of the main themes in text mining. It refers to the process of grouping documents with similar contents or topics into clusters to improve both availability and reliability of text mining...
A Kabbalah System Theory of Ontological and Knowledge Engineering for Knowledge Based Systems
Using the Kabbalah system theory (KST) developed in [1], [2], we propose an ontological engineering for knowledge representation of domains in terms of concept systems in knowledge based systems in artificial intelligenc...
Static Gesture Recognition Combining Graph and Appearance Features
In this paper we propose the combination of graph-based characteristics and appearance-based descriptors such as detected edges for modeling static gestures. Initially we convolve the original image with a Gaussian...