Hypothetical datalog: complexity and expressibility
Theoretical Computer Science
Journal of Logic Programming
Foundations of semantic web databases
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
The DLV system for knowledge representation and reasoning
ACM Transactions on Computational Logic (TOCL)
Yago: a core of semantic knowledge
Proceedings of the 16th international conference on World Wide Web
From SPARQL to rules (and back)
Proceedings of the 16th international conference on World Wide Web
Scalable semantic web data management using vertical partitioning
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Experimenting with recursive queries in database and logic programming systems
Theory and Practice of Logic Programming
Minimal Deductive Systems for RDF
ESWC '07 Proceedings of the 4th European conference on The Semantic Web: Research and Applications
An Effective SPARQL Support over Relational Databases
Semantic Web, Ontologies and Databases
Processing Ontology Alignments with SPARQL
CISIS '08 Proceedings of the 2008 International Conference on Complex, Intelligent and Software Intensive Systems
The Expressive Power of SPARQL
ISWC '08 Proceedings of the 7th International Conference on The Semantic Web
A Rule System for Querying Persistent RDFS Data
ESWC 2009 Heraklion Proceedings of the 6th European Semantic Web Conference on The Semantic Web: Research and Applications
Efficiently Querying RDF(S) Ontologies with Answer Set Programming
Journal of Logic and Computation
Web Semantics: Science, Services and Agents on the World Wide Web
LUBM: A benchmark for OWL knowledge base systems
Web Semantics: Science, Services and Agents on the World Wide Web
SPARQL++ for mapping between RDF vocabularies
OTM'07 Proceedings of the 2007 OTM Confederated international conference on On the move to meaningful internet systems: CoopIS, DOA, ODBASE, GADA, and IS - Volume Part I
YARS2: a federated repository for querying graph structured data from the web
ISWC'07/ASWC'07 Proceedings of the 6th international The semantic web and 2nd Asian conference on Asian semantic web conference
Benchmarking database representations of RDF/S stores
ISWC'05 Proceedings of the 4th international conference on The Semantic Web
Effective integration of declarative rules with external evaluations for semantic-web reasoning
ESWC'06 Proceedings of the 3rd European conference on The Semantic Web: research and applications
Semantics and complexity of SPARQL
ISWC'06 Proceedings of the 5th international conference on The Semantic Web
SPARQL1.1: new features and friends (OWL2, RIF)
RR'10 Proceedings of the Fourth international conference on Web reasoning and rule systems
Redundancy elimination on RDF graphs in the presence of rules, constraints, and queries
RR'10 Proceedings of the Fourth international conference on Web reasoning and rule systems
Practical RDF schema reasoning with annotated semantic web data
ISWC'11 Proceedings of the 10th international conference on The semantic web - Volume Part I
Efficient RDFS entailment in external memory
OTM'11 Proceedings of the 2011th Confederated international conference on On the move to meaningful internet systems
A general framework for representing, reasoning and querying with annotated Semantic Web data
Web Semantics: Science, Services and Agents on the World Wide Web
Efficiently joining group patterns in SPARQL queries
ESWC'10 Proceedings of the 7th international conference on The Semantic Web: research and Applications - Volume Part I
Hi-index | 0.00 |
RDF Schema (RDFS) as a lightweight ontology language is gaining popularity and, consequently, tools for scalable RDFS inference and querying are needed. SPARQL has become recently a W3C standard for querying RDF data, but it mostly provides means for querying simple RDF graphs only, whereas querying with respect to RDFS or other entailment regimes is left outside the current specification. In this paper, we show that SPARQL faces certain unwanted ramifications when querying ontologies in conjunction with RDF datasets that comprise multiple named graphs, and we provide an extension for SPARQL that remedies these effects. Moreover, since RDFS inference has a close relationship with logic rules, we generalize our approach to select a custom ruleset for specifying inferences to be taken into account in a SPARQL query. We show that our extensions are technically feasible by providing benchmark results for RDFS querying in our prototype system GiaBATA, which uses Datalog coupled with a persistent Relational Database as a back-end for implementing SPARQL with dynamic rule-based inference. By employing different optimization techniques like magic set rewriting our system remains competitive with state-of-the-art RDFS querying systems.