Skip to main content
Conference ProceedingsOPEN ACCESS

Taking the RDF model theory out for a spin

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2002) 2342 LNCS 307-317
DOI: 10.1007/3-540-48005-6_24
24Citations
Citations of this article
13Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Entailment, as defined by RDF's model-theoretical semantics, is a basic requirement for processing RDF, and represents the kind of "semantic interoperability" that RDF-based systems have been anticipated to have to realize the vision of the "Semantic Web". In this paper we give some results in our investigation of a practical implementation of the entailment rules, based on the graph-walking query mechanism of the Wilbur RDF toolkit. © Springer-Verlag Berlin Heidelberg 2002.

Cite

CITATION STYLE

APA

Lassila, O. (2002). Taking the RDF model theory out for a spin. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2342 LNCS, pp. 307–317). Springer Verlag. https://doi.org/10.1007/3-540-48005-6_24

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