Extended RDF: Computability and Complexity Issues

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. Based on the undecidability result of ERDF
stable model semantics, 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 also extends RDFS entailment. Equivalence statements
between the two semantics are provided. Additionally, we provide algorithms
that compute the ERDF #n-stable models of syntax-restricted and general
ERDF ontologies. Further, we provide complexity results for the ERDF #nstable
model semantics on syntax-restricted and general ERDF ontologies.
Finally, we provide complexity results for the ERDF stable model semantics
on syntax-restricted ERDF ontologies.