Show simple item record

dc.contributor.authorPolleres, Axelen
dc.identifier.citationReinhard Pichler, Axel Polleres, Fang Wei, Stefan Woltran "Entailment for Domain-restricted RDF", Proceedings of the 5th European Semantic Web Conference (ESWC2008), Springer, 2008.en
dc.description.abstractWe 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.en
dc.rightsAttribution-NonCommercial-NoDerivs 3.0 Ireland
dc.subject.lcshGraph theoryen
dc.titleEntailment for Domain-restricted RDFen
dc.typeConference Paperen
dc.local.publisherstatementThe original publication is available at www.springerlink.comen
dc.contributor.funderScience Foundation Irelanden

Files in this item


This item appears in the following Collection(s)

Show simple item record

Attribution-NonCommercial-NoDerivs 3.0 Ireland
Except where otherwise noted, this item's license is described as Attribution-NonCommercial-NoDerivs 3.0 Ireland