Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: ,  propose fuzzy pD* semantics which generalizes pD* semantics to reason over fuzzy RDF data using OWL vocabulary.  first define the notions of fuzzy RDF graph and fuzzy pD* interpretation.  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.  show the existence of the BDB of an arbitrary triple. After that,  generalize the partial and full pD* closures to obtain the BDBs of derived triples.  show that the partial fuzzy closure exists and can be computed within polynomial time. Finally,  prove soundness and completeness results for the entailment relation.  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.
['Chang Liu', 'Guilin Qi', 'Haofen Wang', 'Yong Yu']
I am writing a research paper on a idea Fuzzy Reasoning over RDF Data Using OWL Vocabulary
[{"from": "human", "value": "I am writing a research paper on a idea Fuzzy Reasoning over RDF Data Using OWL Vocabulary"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: ,  propose fuzzy pD* semantics which generalizes pD* semantics to reason over fuzzy RDF data using OWL vocabulary.  first define the notions of fuzzy RDF graph and fuzzy pD* interpretation.  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.  show the existence of the BDB of an arbitrary triple. After that,  generalize the partial and full pD* closures to obtain the BDBs of derived triples.  show that the partial fuzzy closure exists and can be computed within polynomial time. Finally,  prove soundness and completeness results for the entailment relation.  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."}]