Abstract
Knowledge graphs have become increasingly popular over the past years. The most popular data model for representing knowledge graphs is the Resource Description Framework (RDF). In an open Web environment, it is common case that the RDF knowledge graphs data from different sources may often contain inconsistent or imprecise information. Efficient querying of fuzzy RDF knowledge graphs is therefore of increasing importance. In this paper, we firstly introduce practical extensions of the RDF model to represent vagueness based on fuzzy graph. Then we extend the concept of SPARQL graph pattern making it possible to query an element-level fuzzy RDF knowledge graphs with high degree of truth. Finally, we present a backtracking algorithm for calculating the set of homomorphisms from fuzzy SPARQL graph into a fuzzy RDF graph to demonstrate our proposed methods.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
