Extended RDF as a semantic foundation of rule markup languages

Anastasia Analyti, Grigoris Antoniou, Carlos Viegas Damásio, Gerd Wagner

Research output: Contribution to journalArticle

25 Citations (Scopus)

Abstract

Ontologies and automated reasoning are the building blocks of the Semantic Web initiative. Derivation rules can be included in an ontology to define derived concepts, based on base concepts. For example, rules allow to define the extension of a class or property, based on a complex relation between the extensions of the same or other classes and properties. On the other hand, the inclusion of negative information both in the form of negation-asfailure and explicit negative information is also needed to enable various forms of reasoning. In this paper, we extend RDF graphs with weak and strong negation, as well as derivation rules. The ERDF stable model semantics of the extended framework (Extended RDF) is defined, extending RDF(S) semantics. A distinctive feature of our theory, which is based on Partial Logic, is that both truth and falsity extensions of properties and classes are considered, allowing for truth value gaps. Our framework supports both closed-world and open-world reasoning through the explicit representation of the particular closed-world assumptions and the ERDF ontological categories of total properties and total classes.

Original languageEnglish
Pages (from-to)37-94
Number of pages58
JournalJournal of Artificial Intelligence Research
Volume32
DOIs
Publication statusPublished - 15 May 2008
Externally publishedYes

Fingerprint

Markup languages
Ontology
Semantics
Semantic Web

Cite this

Analyti, Anastasia ; Antoniou, Grigoris ; Damásio, Carlos Viegas ; Wagner, Gerd. / Extended RDF as a semantic foundation of rule markup languages. In: Journal of Artificial Intelligence Research. 2008 ; Vol. 32. pp. 37-94.
@article{076bab3a6aaa438db53a79eef5670b4a,
title = "Extended RDF as a semantic foundation of rule markup languages",
abstract = "Ontologies and automated reasoning are the building blocks of the Semantic Web initiative. Derivation rules can be included in an ontology to define derived concepts, based on base concepts. For example, rules allow to define the extension of a class or property, based on a complex relation between the extensions of the same or other classes and properties. On the other hand, the inclusion of negative information both in the form of negation-asfailure and explicit negative information is also needed to enable various forms of reasoning. In this paper, we extend RDF graphs with weak and strong negation, as well as derivation rules. The ERDF stable model semantics of the extended framework (Extended RDF) is defined, extending RDF(S) semantics. A distinctive feature of our theory, which is based on Partial Logic, is that both truth and falsity extensions of properties and classes are considered, allowing for truth value gaps. Our framework supports both closed-world and open-world reasoning through the explicit representation of the particular closed-world assumptions and the ERDF ontological categories of total properties and total classes.",
author = "Anastasia Analyti and Grigoris Antoniou and Dam{\'a}sio, {Carlos Viegas} and Gerd Wagner",
year = "2008",
month = "5",
day = "15",
doi = "10.1613/jair.2425",
language = "English",
volume = "32",
pages = "37--94",
journal = "Journal of Artificial Intelligence Research",
issn = "1076-9757",
publisher = "Morgan Kaufmann Publishers, Inc.",

}

Extended RDF as a semantic foundation of rule markup languages. / Analyti, Anastasia; Antoniou, Grigoris; Damásio, Carlos Viegas; Wagner, Gerd.

In: Journal of Artificial Intelligence Research, Vol. 32, 15.05.2008, p. 37-94.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Extended RDF as a semantic foundation of rule markup languages

AU - Analyti, Anastasia

AU - Antoniou, Grigoris

AU - Damásio, Carlos Viegas

AU - Wagner, Gerd

PY - 2008/5/15

Y1 - 2008/5/15

N2 - Ontologies and automated reasoning are the building blocks of the Semantic Web initiative. Derivation rules can be included in an ontology to define derived concepts, based on base concepts. For example, rules allow to define the extension of a class or property, based on a complex relation between the extensions of the same or other classes and properties. On the other hand, the inclusion of negative information both in the form of negation-asfailure and explicit negative information is also needed to enable various forms of reasoning. In this paper, we extend RDF graphs with weak and strong negation, as well as derivation rules. The ERDF stable model semantics of the extended framework (Extended RDF) is defined, extending RDF(S) semantics. A distinctive feature of our theory, which is based on Partial Logic, is that both truth and falsity extensions of properties and classes are considered, allowing for truth value gaps. Our framework supports both closed-world and open-world reasoning through the explicit representation of the particular closed-world assumptions and the ERDF ontological categories of total properties and total classes.

AB - Ontologies and automated reasoning are the building blocks of the Semantic Web initiative. Derivation rules can be included in an ontology to define derived concepts, based on base concepts. For example, rules allow to define the extension of a class or property, based on a complex relation between the extensions of the same or other classes and properties. On the other hand, the inclusion of negative information both in the form of negation-asfailure and explicit negative information is also needed to enable various forms of reasoning. In this paper, we extend RDF graphs with weak and strong negation, as well as derivation rules. The ERDF stable model semantics of the extended framework (Extended RDF) is defined, extending RDF(S) semantics. A distinctive feature of our theory, which is based on Partial Logic, is that both truth and falsity extensions of properties and classes are considered, allowing for truth value gaps. Our framework supports both closed-world and open-world reasoning through the explicit representation of the particular closed-world assumptions and the ERDF ontological categories of total properties and total classes.

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

UR - https://doi.org/10.1613/jair.2425

U2 - 10.1613/jair.2425

DO - 10.1613/jair.2425

M3 - Article

VL - 32

SP - 37

EP - 94

JO - Journal of Artificial Intelligence Research

JF - Journal of Artificial Intelligence Research

SN - 1076-9757

ER -