Publication

Entailment for Domain-restricted RDF

Polleres, Axel
Loading...
Thumbnail Image
Repository DOI
Publication Date
2008
Keywords
Type
Conference Paper
Downloads
Citation
Reinhard Pichler, Axel Polleres, Fang Wei, Stefan Woltran "Entailment for Domain-restricted RDF", Proceedings of the 5th European Semantic Web Conference (ESWC2008), Springer, 2008.
Abstract
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 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 prove that the entailment is tractable for unrestricted graphs and coNP-complete for domain-restricted graphs.
Publisher
Springer
Publisher DOI
Rights
Attribution-NonCommercial-NoDerivs 3.0 Ireland