2005 | OriginalPaper | Buchkapitel
RDF Entailment as a Graph Homomorphism
verfasst von : Jean-François Baget
Erschienen in: The Semantic Web – ISWC 2005
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
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.