Fuzzy Reasoning over RDF Data Using OWL Vocabulary

Authors:
Chang Liu;Guilin Qi;Haofen Wang;Yong Yu
Affiliations:
-;-;-;-
Venue:
WI-IAT '11 Proceedings of the 2011 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology - Volume 01
Year:
2011

Citing 9
Cited 1

Scalable querying services over fuzzy ontologies

Proceedings of the 17th international conference on World Wide Web
Minimal Deductive Systems for RDF

ESWC '07 Proceedings of the 4th European conference on The Semantic Web: Research and Applications
A Fuzzy Semantics for the Resource Description Framework

Uncertainty Reasoning for the Semantic Web I
Reasoning within fuzzy description logics

Journal of Artificial Intelligence Research
Reasoning with very expressive fuzzy description logics

Journal of Artificial Intelligence Research
A Minimal Deductive System for General Fuzzy RDF

RR '09 Proceedings of the 3rd International Conference on Web Reasoning and Rule Systems
Completeness, decidability and complexity of entailment for RDF Schema and a semantic extension involving the OWL vocabulary

Web Semantics: Science, Services and Agents on the World Wide Web
AnQL: SPARQLing up annotated RDFS

ISWC'10 Proceedings of the 9th international semantic web conference on The semantic web - Volume Part I
Annotated RDF

ESWC'06 Proceedings of the 3rd European conference on The Semantic Web: research and applications

Large scale fuzzy pD* reasoning using mapreduce

ISWC'11 Proceedings of the 10th international conference on The semantic web - Volume Part I

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we propose fuzzy pD* semantics which generalizes pD* semantics to reason over fuzzy RDF data using OWL vocabulary. We first define the notions of fuzzy RDF graph and fuzzy pD* interpretation. We then present a set of fuzzy pD*entailment rules and define the Best Degree Bound (BDB) of a triple derived from a fuzzy RDF graph. We show the existence of the BDB of an arbitrary triple. After that, we generalize the partial and full pD* closures to obtain the BDBs of derived triples. We show that the partial fuzzy closure exists and can be computed within polynomial time. Finally, we prove soundness and completeness results for the entailment relation. We also prove that the consistency checking is in P, the entailment is NP-complete, and in P if the target fuzzy RDF graph is ground. Therefore, extending the pD* semantics with fuzzy semantics does not increase the computational complexity.