I1-D3-2 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-as-failure 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. Keyword List RDF, negation, rules, closed-world reasoning Extended RDF as a Semantic Foundation of Rule Markup Languages Anastasia Analyti, Grigoris Antoniou, Carlos Viegas Damásio, and Gerd Wagner 1 Institute of Computer Science, FORTH-ICS, Greece 2 Department of Computer Science, University of Crete, Greece 3 Centro de Inteligência Artificial, Universidade Nova de Lisboa, Caparica, Portugal 4 Institute of Informatics, Brandenburg University of Technology at Cottbus, Germany analyti@ics.forth.gr, antoniou@ics.forth.gr, cd@di.fct.unl.pt, G.Wagner@tu-cottbus.de Abstract. Ontologies and automated reasoning are the building blocks 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-as-failure 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.

2 Figures and Tables

Cite this paper

@inproceedings{Analyti2005I1D32ER, title={I1-D3-2 Extended RDF as a Semantic Foundation of Rule Markup Languages}, author={Anastasia Analyti and Gerd Wagner and Tim Furche and Grigoris Antoniou and Carlos Viegas Dam{\'a}sio}, year={2005} }