Abstract
RDF is rapidly being adopted around the world as a paradigm for knowledge representation. However, we are not aware of any version of RDF that can express probabilistic knowledge. In this paper, we develop a framework called Probabilistic RDF (pRDF for short) - we provide a syntax as well as a model theoretic and fixpoint semantics for acyclic pRDF theories. We then provide algorithms to efficiently answer queries posed to pRDF ontologies. We have developed a prototype implementation that shows that our algorithms work very well in practice. © 2006 IEEE.
Cite
CITATION STYLE
Udrea, O., Subrahmanian, V. S., & Majkić, Z. (2006). Probabilistic RDF. In Proceedings of the 2006 IEEE International Conference on Information Reuse and Integration, IRI-2006 (pp. 172–177). https://doi.org/10.1109/IRI.2006.252408
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
