Thumbnail
Access Restriction
Open

Author Bruijn, Jos De ♦ Heymans, Stijn
Source CiteSeerX
Content type Text
File Format PDF
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword Logical Foundation ♦ Various Rdf Entailment Regime ♦ Important Open Question ♦ Various Fragment ♦ Data Complexity ♦ Logic Programming ♦ Precise Rela-tionship ♦ Semantic Web ♦ Standard Knowledge Representation Formalism ♦ Conjunctive Querying ♦ Description Logic ♦ Deductive Database ♦ Descrip-tion Logic ♦ Several Novel Complexity Result ♦ Rdf Graph
Abstract Abstract. An important open question in the semantic Web is the precise rela-tionship 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 embed-dings we consider show how techniques from deductive databases and descrip-tion 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. 1
Educational Role Student ♦ Teacher
Age Range above 22 year
Educational Use Research
Education Level UG and PG ♦ Career/Technical Study
Learning Resource Type Article