Abstract
In the previous work we accomplished the problem of defining fuzzy dependency as well as projection and join operators which allow us to decompose a database in such a way that this process is fuzzy loss less. The definition of rules-based fuzzy dependency did not satisfy the transitivity axiom, which is crucial to obtaining the completeness of the counterpart of Armstrong axioms for fuzzy dependencies. In this paper we introduce an alternative definition of dependency called restricted dependency, satisfying the transitivity property of inference. All the results obtained with the first definition of dependency are also extended to this case. The price to pay for transitivity is a more restricted definition of fuzzy dependency.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
