Logical foundations of object-oriented and frame-based languages
Journal of the ACM (JACM)
First-order logic and automated theorem proving (2nd ed.)
First-order logic and automated theorem proving (2nd ed.)
Complexity and expressive power of logic programming
ACM Computing Surveys (CSUR)
Foundations of semantic web databases
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
RDFS(FA): Connecting RDF(S) and OWL DL
IEEE Transactions on Knowledge and Data Engineering
From SPARQL to rules (and back)
Proceedings of the 16th international conference on World Wide Web
RDF and Logic: Reasoning and Extension
DEXA '07 Proceedings of the 18th International Conference on Database and Expert Systems Applications
On the Relationship between Description Logic-based and F-Logic-based Ontologies
Fundamenta Informaticae
Web Semantics: Science, Services and Agents on the World Wide Web
Stable model theory for extended RDF ontologies
ISWC'05 Proceedings of the 4th international conference on The Semantic Web
Combining RDF and part of OWL with rules: semantics, decidability, complexity
ISWC'05 Proceedings of the 4th international conference on The Semantic Web
Semantics and complexity of SPARQL
ISWC'06 Proceedings of the 5th international conference on The Semantic Web
On the Relationship between Description Logic-based and F-Logic-based Ontologies
Fundamenta Informaticae
Combining a DL Reasoner and a Rule Engine for Improving Entailment-Based OWL Reasoning
ISWC '08 Proceedings of the 7th International Conference on The Semantic Web
SAOR: Authoritative Reasoning for the Web
ASWC '08 Proceedings of the 3rd Asian Semantic Web Conference on The Semantic Web
Datalog±: a unified approach to ontologies and integrity constraints
Proceedings of the 12th International Conference on Database Theory
A general datalog-based framework for tractable query answering over ontologies
Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Simple and Efficient Minimal RDFS
Web Semantics: Science, Services and Agents on the World Wide Web
Agent Inferencing Meets the Semantic Web
EPIA '09 Proceedings of the 14th Portuguese Conference on Artificial Intelligence: Progress in Artificial Intelligence
Logical foundations of RDF(S) with datatypes
Journal of Artificial Intelligence Research
Embedding nonground logic programs into autoepistemic logic for knowledge-base combination
ACM Transactions on Computational Logic (TOCL)
Scalable OWL 2 reasoning for linked data
RW'11 Proceedings of the 7th international conference on Reasoning web: semantic technologies for the web of data
A logical toolbox for ontological reasoning
ACM SIGMOD Record
Semantic Web search based on ontological conjunctive queries
Web Semantics: Science, Services and Agents on the World Wide Web
Ontological query answering under expressive Entity-Relationship schemata
Information Systems
Datalog+/-: a family of languages for ontology querying
Datalog'10 Proceedings of the First international conference on Datalog Reloaded
A general Datalog-based framework for tractable query answering over ontologies
Web Semantics: Science, Services and Agents on the World Wide Web
On the Relationship between Description Logic-based and F-Logic-based Ontologies
Fundamenta Informaticae
RDFS and OWL reasoning for linked data
RW'13 Proceedings of the 9th international conference on Reasoning Web: semantic technologies for intelligent data access
| Hi-index | 0.00 |
An important open question in the semantic Web is the precise relationship between the RDF(S) semantics and the semantics of standard knowledge representation formalisms such as logic programming and description logics. In this paper we address this issue by considering embeddings of RDF and RDFS in logic. Using these embeddings, combined with existing results about various fragments of logic, we establish several novel complexity results. The embeddings we consider show how techniques from deductive databases and description logics can be used for reasoning with RDF(S). Finally, we consider querying RDF graphs and establish the data complexity of conjunctive querying for the various RDF entailment regimes.