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.
Research described in this paper was supported in part by Nokia Research Center, Nokia Mobile Phones and Nokia Venture Partners.
Chapter PDF
Similar content being viewed by others
Keywords
- Resource Description Framework
- Query Language
- Transitive Closure
- Path Expression
- Resource Description Framework Data
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
S. Abiteboul, D. Quass, J. McHugh, J. Widom, and J. L. Wiener. The Lorel query language for semistructured data. International Journal on Digital Libraries, 1(1):68–88, 1997.
A. V. Aho, R. Sethi, and J. D. Ullman. Compilers: Principles, Techniques and Tools Addison-Wesley, 1986.
T. Berners-Lee, J. Hendler, and O. Lassila. The Semantic Web. Scientific American, 284(5):34–43, May 2001.
D. Brickley and R.V. Guha. Resource Description Framework (RDF) Schema Specification 1.0. W3C Candidate Recommendation, March 2000.
M. P. Consens and A. O. Mendelzon. GraphLog: a visual formalism for real life recursion. In Proceedings of the Ninth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems. ACM Press, 1990.
I. F. Cruz, A. O. Mendelzon, and P. T. Wood. A graphical query language supporting recursion. In Proceedings of the ACM SIGMOD Annual Conference on Management of Data, pages 323–330, 1987.
S. Decker, D. Brickley, J. Saarela, and J. Angele. A query and inference service for RDF. In W3C Query Languages Workshop (QL’98), December 1998.
C. L. Forgy. A fast algorithm for the many pattern/many object pattern match problem. Artificial Intelligence, 19(1):17–37, September 1982.
M. S. Fox. Knowledge representation for decision support. In Methlie and Sprague, editors, Knowledge Representation for Decision Support Systems. Elsevier, 1985.
P. Hayes. RDF Model Theory. W3C Working Draft, February 2002.
J. Hynynen and O. Lassila. On the Use of Object-Oriented Paradigm in a Distributed Problem Solver. AI Communications, 2(3):142–151, 1989.
O. Lassila. Enabling Semantic Web Programming by Integrating RDF and Common Lisp. In Proceedings of the First Semantic Web Working Symposium. Stanford University, 2001.
O. Lassila and R. R. Swick. Resource Description Framework (RDF) Model and Syntax Specification. W3C Recommendation, February 1999.
A. O. Mendelzon and P. T. Wood. Finding regular simple paths in graph databases. SIAM Journal on Computing, 24(6):1235–1258, December 1995.
M. Sintek and S. Decker. TRIPLE—A Query, Inference, and Transformation Language for the Semantic Web. Accepted to ISWC 2002.
R. E. Tarjan. Fast algorithms for solving path problems. Journal of the ACM, 28(3):594–614, 1981.
M. Yannakakis. Graph-theoretic methods in database theory. In Proceedings of the Ninth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pages 230–242, 1990.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lassila, O. (2002). Taking the RDF Model Theory Out for a Spin. In: Horrocks, I., Hendler, J. (eds) The Semantic Web — ISWC 2002. ISWC 2002. Lecture Notes in Computer Science, vol 2342. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48005-6_24
Download citation
DOI: https://doi.org/10.1007/3-540-48005-6_24
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43760-4
Online ISBN: 978-3-540-48005-1
eBook Packages: Springer Book Archive