On the Computability and Complexity Issues of Extended RDF

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

doi:10.1007/978-3-540-89197-0_5

On the Computability and Complexity Issues of Extended RDF

Anastasia Analyti, Carlos Viegas Damásio + Show 2 more

Open Access

https://doi.org/10.1007/978-3-540-89197-0_5

Copy DOI

Publication Date: Jan 1, 2008

Citations: 16

Affiliation: FORTH Institute of Computer Science, Universidade Nova de Lisboa, Brandenburg University of Technology Cottbus-Senftenberg, University of Crete

#Equivalence Statement #RDF Graphs + Show 8 more

Abstract
Full-Text PDF
Similar Papers

Abstract

ERDF stable model semantics is a recently proposed semantics for ERDF ontologies and a faithful extension of RDFS semantics on RDF graphs. In this paper, we elaborate on the computability and complexity issues of the ERDF stable model semantics. We show that decidability under this semantics cannot be achieved, unless ERDF ontologies of restricted syntax are considered. Therefore, we propose a slightly modified semantics for ERDF ontologies, called ERDF #n-stable model semantics. We show that entailment under this semantics is in general decidable and it also extends RDFS entailment. An equivalence statement between the two semantics and various complexity results are provided.KeywordsExtended RDF ontologiesSemantic Webnegationrulescomplexity

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Similar Papers

Paper Title

Journal

Date

Author

View more papers

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.