Presented at: 5th European Semantic Web Conference (ESWC2008)http://dx.doi.org/10.1007/978-3-540-68234-9_17
We introduce domain-restricted RDF (dRDF) which allows to associate an RDF graph with a fixed, finite domain that interpretations for it may range over. We show that dRDF is a real extension of RDF and discuss impacts on the complexity of entailment in dRDF. The entailment problem represents the key reasoning task for RDF and is well known to be NP-complete. Remarkably, we show that the restriction of domains in dRDF raises the complexity of entailment from NP- to $\Pi^P_2$-completeness. In order to lower complexity of entailment for both domain-restricted and unrestricted graphs, we take a closer look at the graph structure. For cases where the structure of RDF graphs is restricted via the concept of bounded treewidth, we manage to prove tractability of entailment. We also present a polynomial entailment checking algorithm for such graphs.
Keywords: complexity, entailment, h-subsumption, rdf, semantic web, Formal Languages, Inference, Logic, SPARQL, Semantic Web
Resource URI on the dog food server: http://data.semanticweb.org/conference/eswc/2008/paper/120
Same as: http://revyu.com/things/eswc-2008-paper-entailment-for-rdf
Same as: http://semanticweb.org/id/Entailment_for_Domain-restricted_RDF
Explore this resource elsewhere: