Computability and Complexity Issues of Extended RDF

Authors:
Anastasia Analyti;Grigoris Antoniou;Carlos Viegas Damásio;Gerd Wagner
Affiliations:
Institute of Computer Science, FORTH-ICS, Crete, Greece, e-mail: analyti@ics.forth.gr;Institute of Computer Science, FORTH-ICS, Crete, Greece, e-mail: analyti@ics.forth.gr and Department of Computer Science, University of Crete, Greece;CENTRIA, Departamento de Informatica, Faculdade de Ciencias e Tecnologia, Universidade Nova de Lisboa, 2829-516 Caparica, Portugal;Inst. of Informatics, Brandenburg Univ. of Technology at Cottbus, Germany
Venue:
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
Year:
2008

Citing 2
Cited 1

Logic programs with classical negation

Logic programming
Extended RDF as a semantic foundation of rule markup languages

Journal of Artificial Intelligence Research

Identifying conceptual layers in the ontology development process

SETN'12 Proceedings of the 7th Hellenic conference on Artificial Intelligence: theories and applications

Quantified Score

Hi-index	0.03

Visualization

Abstract

ERDF stable model semantics is a recently proposed semantics for ERDF ontologies and a faithful extension of RDFS semantics on RDF graphs. Unfortunately, ERDF stable model semantics is in general undecidable. In this paper, we elaborate on the computability and complexity issues of the ERDF stable model semantics.