Why-provenance information for RDF, rules, and negation

Anastasia Analyti, Carlos V. Damásio, Grigoris Antoniou, Ioannis Pachoulakis

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

The provenance (i.e., origins) of derived information on the Web is crucial in many applications to allow information quality assessment, trust judgments, accountability, as well as understanding the temporal and spatial status of the information. On the other hand, the inclusion of negative information in knowledge representation both in the form of negation-as-failure and explicit negation is also important to allow various forms of reasoning, provided that weakly negated information is associated with the sources (contexts) in which it holds. In this work, we consider collections of g-RDF ontologies, distributed over the web, along with a set of conflict statements expressing that information within a pair of g-RDF ontologies cannot be combined together for deriving new information. A g-RDF ontology is the combination of (i) a g-RDF graph G (i.e., a set of positive and strongly negated RDF triples, called g-RDF triples) and (ii) a g-RDF program P containing derivation rules with possibly both explicit and scoped weak negation. Information can be inferred through the g-RDF graphs or the derivation rules of the g-RDF ontologies, or through the RDFS derivation rules. We associate each derived grounded g-RDF triple [¬] p(s, o) with the set of names S of the g-RDF ontologies that contributed to its derivation. To achieve this, we define the provenance stable models of a g-RDF ontology collection. We show that our provenance g-RDF semantics faithfully extends RDFS semantics. Finally, we provide an algorithm based on Answer Set Programming that computes all provenance stable models of a g-RDF ontology collection and provides the answer to various kinds of queries. Various complexity results are provided.

LanguageEnglish
Pages221-277
Number of pages57
JournalAnnals of Mathematics and Artificial Intelligence
Volume70
Issue number3
DOIs
Publication statusPublished - 2014

Fingerprint

Provenance
Ontology
Stable Models
Semantics
Negation as Failure
Information Quality
Accountability
Answer Set Programming
Quality Assessment
Knowledge representation
Knowledge Representation
Graph in graph theory
Reasoning
Inclusion
Query

Cite this

Analyti, Anastasia ; Damásio, Carlos V. ; Antoniou, Grigoris ; Pachoulakis, Ioannis. / Why-provenance information for RDF, rules, and negation. In: Annals of Mathematics and Artificial Intelligence. 2014 ; Vol. 70, No. 3. pp. 221-277.
@article{efb45b13503d4eef9c4e34865c4e7324,
title = "Why-provenance information for RDF, rules, and negation",
abstract = "The provenance (i.e., origins) of derived information on the Web is crucial in many applications to allow information quality assessment, trust judgments, accountability, as well as understanding the temporal and spatial status of the information. On the other hand, the inclusion of negative information in knowledge representation both in the form of negation-as-failure and explicit negation is also important to allow various forms of reasoning, provided that weakly negated information is associated with the sources (contexts) in which it holds. In this work, we consider collections of g-RDF ontologies, distributed over the web, along with a set of conflict statements expressing that information within a pair of g-RDF ontologies cannot be combined together for deriving new information. A g-RDF ontology is the combination of (i) a g-RDF graph G (i.e., a set of positive and strongly negated RDF triples, called g-RDF triples) and (ii) a g-RDF program P containing derivation rules with possibly both explicit and scoped weak negation. Information can be inferred through the g-RDF graphs or the derivation rules of the g-RDF ontologies, or through the RDFS derivation rules. We associate each derived grounded g-RDF triple [¬] p(s, o) with the set of names S of the g-RDF ontologies that contributed to its derivation. To achieve this, we define the provenance stable models of a g-RDF ontology collection. We show that our provenance g-RDF semantics faithfully extends RDFS semantics. Finally, we provide an algorithm based on Answer Set Programming that computes all provenance stable models of a g-RDF ontology collection and provides the answer to various kinds of queries. Various complexity results are provided.",
keywords = "Complexity, Negation, Program rules, Query answering, RDF graphs, Why-provenance",
author = "Anastasia Analyti and Dam{\'a}sio, {Carlos V.} and Grigoris Antoniou and Ioannis Pachoulakis",
year = "2014",
doi = "10.1007/s10472-013-9396-0",
language = "English",
volume = "70",
pages = "221--277",
journal = "Annals of Mathematics and Artificial Intelligence",
issn = "1012-2443",
publisher = "Springer Netherlands",
number = "3",

}

Why-provenance information for RDF, rules, and negation. / Analyti, Anastasia; Damásio, Carlos V.; Antoniou, Grigoris; Pachoulakis, Ioannis.

In: Annals of Mathematics and Artificial Intelligence, Vol. 70, No. 3, 2014, p. 221-277.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Why-provenance information for RDF, rules, and negation

AU - Analyti, Anastasia

AU - Damásio, Carlos V.

AU - Antoniou, Grigoris

AU - Pachoulakis, Ioannis

PY - 2014

Y1 - 2014

N2 - The provenance (i.e., origins) of derived information on the Web is crucial in many applications to allow information quality assessment, trust judgments, accountability, as well as understanding the temporal and spatial status of the information. On the other hand, the inclusion of negative information in knowledge representation both in the form of negation-as-failure and explicit negation is also important to allow various forms of reasoning, provided that weakly negated information is associated with the sources (contexts) in which it holds. In this work, we consider collections of g-RDF ontologies, distributed over the web, along with a set of conflict statements expressing that information within a pair of g-RDF ontologies cannot be combined together for deriving new information. A g-RDF ontology is the combination of (i) a g-RDF graph G (i.e., a set of positive and strongly negated RDF triples, called g-RDF triples) and (ii) a g-RDF program P containing derivation rules with possibly both explicit and scoped weak negation. Information can be inferred through the g-RDF graphs or the derivation rules of the g-RDF ontologies, or through the RDFS derivation rules. We associate each derived grounded g-RDF triple [¬] p(s, o) with the set of names S of the g-RDF ontologies that contributed to its derivation. To achieve this, we define the provenance stable models of a g-RDF ontology collection. We show that our provenance g-RDF semantics faithfully extends RDFS semantics. Finally, we provide an algorithm based on Answer Set Programming that computes all provenance stable models of a g-RDF ontology collection and provides the answer to various kinds of queries. Various complexity results are provided.

AB - The provenance (i.e., origins) of derived information on the Web is crucial in many applications to allow information quality assessment, trust judgments, accountability, as well as understanding the temporal and spatial status of the information. On the other hand, the inclusion of negative information in knowledge representation both in the form of negation-as-failure and explicit negation is also important to allow various forms of reasoning, provided that weakly negated information is associated with the sources (contexts) in which it holds. In this work, we consider collections of g-RDF ontologies, distributed over the web, along with a set of conflict statements expressing that information within a pair of g-RDF ontologies cannot be combined together for deriving new information. A g-RDF ontology is the combination of (i) a g-RDF graph G (i.e., a set of positive and strongly negated RDF triples, called g-RDF triples) and (ii) a g-RDF program P containing derivation rules with possibly both explicit and scoped weak negation. Information can be inferred through the g-RDF graphs or the derivation rules of the g-RDF ontologies, or through the RDFS derivation rules. We associate each derived grounded g-RDF triple [¬] p(s, o) with the set of names S of the g-RDF ontologies that contributed to its derivation. To achieve this, we define the provenance stable models of a g-RDF ontology collection. We show that our provenance g-RDF semantics faithfully extends RDFS semantics. Finally, we provide an algorithm based on Answer Set Programming that computes all provenance stable models of a g-RDF ontology collection and provides the answer to various kinds of queries. Various complexity results are provided.

KW - Complexity

KW - Negation

KW - Program rules

KW - Query answering

KW - RDF graphs

KW - Why-provenance

UR - http://www.scopus.com/inward/record.url?scp=84899457372&partnerID=8YFLogxK

U2 - 10.1007/s10472-013-9396-0

DO - 10.1007/s10472-013-9396-0

M3 - Article

VL - 70

SP - 221

EP - 277

JO - Annals of Mathematics and Artificial Intelligence

T2 - Annals of Mathematics and Artificial Intelligence

JF - Annals of Mathematics and Artificial Intelligence

SN - 1012-2443

IS - 3

ER -