Matches in ScholarlyData for { <https://w3id.org/scholarlydata/inproceedings/eswc2008/paper/120> ?p ?o. }
Showing items 1 to 21 of
21
with 100 items per page.
- 120 creator axel-polleres.
- 120 creator fang-wei.
- 120 creator reinhard-pichler.
- 120 creator stefan-woltran.
- 120 type InProceedings.
- 120 label "Entailment for Domain-restricted RDF".
- 120 sameAs 120.
- 120 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 $\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.".
- 120 hasAuthorList authorList.
- 120 hasTopic Formal_languages.
- 120 hasTopic Inference.
- 120 hasTopic Logic.
- 120 hasTopic SPARQL.
- 120 hasTopic Semantic_Web.
- 120 isPartOf proceedings.
- 120 keyword "complexity".
- 120 keyword "entailment".
- 120 keyword "h-subsumption".
- 120 keyword "rdf".
- 120 keyword "semantic web".
- 120 title "Entailment for Domain-restricted RDF".