Skip to main content
Conference ProceedingsOPEN ACCESS

RDF entailment as a graph homomorphism

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2005) 3729 LNCS 82-96
DOI: 10.1007/11574620_9
31Citations
Citations of this article
23Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Semantic consequence (entailment) in RDF is ususally computed using Pat Hayes Interpolation Lemma. In this paper, we reformulate this mechanism as a graph homomorphism known as projection in the conceptual graphs community. Though most of the paper is devoted to a detailed proof of this result, we discuss the immediate benefits of this reformulation: it is now easy to translate results from different communities (e.g. conceptual graphs, constraint programming, ...) to obtain new polynomial cases for the NP-complete RDF ENTAILMENT problem, as well as numerous algorithmic optimizations. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Baget, J. F. (2005). RDF entailment as a graph homomorphism. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3729 LNCS, pp. 82–96). https://doi.org/10.1007/11574620_9

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free