Back to first pageBack to first page Centre for Artificial Intelligence of UNL
Browse our site
You are here:

Publication details

Go back
Publication details
Main information
Reasoning with Annotated Semantic Web Data
November 2011
FFerreira2011:msc
The RDF Schema reification method allows the introduction of meta-data about RDF(S) statements, but it is not possible to perform inference over reified data. As an alternative it was proposed to extend classical Semantic Web data with annotations. This extension possesses a formal semantics accompanied by a complete set of inference rules. Furthermore Semantic Web data with annotations is becoming available, where YAGO knowledge base is a prominent example. In our work we present an approach to perform the closure of large RDF Schema graphs with confidence annotations using standard relational database technology. We define a $\rho$df rule dependency graph, introduce inheritance rules as non-recursive and present implementations for both classical and annotated inference rules. We also focus on the implementation of different algorithms to perform the transitive closure. A comparative analysis and extensive benchmarking are also detailed.
M. Sc. dissertation
Filipe Ferreira
Carlos Viegas Damásio
Faculdade de Ciências e Tecnologia da Universidade Nova de Lisboa
-
-
Export formats
Filipe Ferreira, Reasoning with Annotated Semantic Web Data, Carlos Viegas Damásio (superv.), Faculdade de Ciências e Tecnologia da Universidade Nova de Lisboa, November 2011.
<b>Filipe Ferreira</b>, <u>Reasoning with Annotated Semantic Web Data</u>, <a href="/people/members/view.php?code=feecf7159d8e22c70a3bf33436444903" class="supervisor">Carlos Viegas Damásio</a> (superv.), Faculdade de Ciências e Tecnologia da Universidade Nova de Lisboa, November 2011.
@mastersthesis {FFerreira2011:msc, author = {Filipe Ferreira}, title = {Reasoning with Annotated Semantic Web Data}, school = {Faculdade de Ci{\^e}ncias e Tecnologia da Universidade Nova de Lisboa}, note = {Carlos Viegas Dam{\'a}sio (superv.); }, abstract = {The RDF Schema reification method allows the introduction of meta-data about RDF(S) statements, but it is not possible to perform inference over reified data. As an alternative it was proposed to extend classical Semantic Web data with annotations. This extension possesses a formal semantics accompanied by a complete set of inference rules. Furthermore Semantic Web data with annotations is becoming available, where YAGO knowledge base is a prominent example. In our work we present an approach to perform the closure of large RDF Schema graphs with confidence annotations using standard relational database technology. We define a $\rho$df rule dependency graph, introduce inheritance rules as non-recursive and present implementations for both classical and annotated inference rules. We also focus on the implementation of different algorithms to perform the transitive closure. A comparative analysis and extensive benchmarking are also detailed.}, month = {November}, year = {2011}, }
Publication's urls
/publications/view.php?code=fcabf1f0b645a4f8caaf3dae621c4d6f
/publications/view.php?code=FFerreira2011:msc
Go back
Centre for Artificial Intelligence of UNL
Departamento de Informática, FCT/UNL
Quinta da Torre 2829-516 CAPARICA - Portugal
Tel. (+351) 21 294 8536 FAX (+351) 21 294 8541

Fundacao_FCT