Decidability and expressiveness aspects of logic queries
PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
SIAM Journal on Computing
Conjunctive query containment revisited
Theoretical Computer Science - Special issue on the 6th International Conference on Database Theory—ICDT '97
On the Complexity of H-Subsumption
Proceedings of the 12th International Workshop on Computer Science Logic
Description logic programs: combining logic programs with description logic
WWW '03 Proceedings of the 12th international conference on World Wide Web
Foundations of semantic web databases
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
The Description Logic Handbook
The Description Logic Handbook
Guarded hybrid knowledge bases12
Theory and Practice of Logic Programming
Web Semantics: Science, Services and Agents on the World Wide Web
Rules with contextually scoped negation
ESWC'06 Proceedings of the 3rd European conference on The Semantic Web: research and applications
On representational issues about combinations of classical theories with nonmonotonic rules
KSEM'06 Proceedings of the First international conference on Knowledge Science, Engineering and Management
Parameterized Complexity
Foundations of Semantic Web databases
Journal of Computer and System Sciences
ISWC'11 Proceedings of the 10th international conference on The semantic web - Volume Part I
Hi-index | 0.00 |
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 Π2P -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.