An Efficient Algorithm For Reasoning About Fuzzy Functional Dependencies

IWANN'11 Proceedings of the 11th international conference on Artificial neural networks conference on Advances in computational intelligence - Volume Part II(2011)

Cited 3|Views0
No score
Abstract
A sound and complete Automated Prover for the Fuzzy Simplification Logic (FSL logic) is introduced and based on it a method for efficiently reasoning about fuzzy functional dependencies over domains with similarity relations. The complexity of the algorithm is the same as that of equivalent algorithms for crisp functional dependencies that appear in the literature.
More
Translated text
Key words
crisp functional dependency,fuzzy functional dependency,FSL logic,Fuzzy Simplification Logic,complete Automated Prover,equivalent algorithm,similarity relation,efficient algorithm
AI Read Science
Must-Reading Tree
Example
Generate MRT to find the research sequence of this paper
Chat Paper
Summary is being generated by the instructions you defined