Abstract
In this paper we introduce RL-instances as a way to represent and manipulate gradual conjunctive collections of tuples. Our proposal, based on the theory of Representation by Levels, overcomes the limitations of fuzzy instances in keeping all the properties of conventional Relational Algebra operations. We provide a proof of concept implementation in a conventional relational database management system, where flexible queries can be performed on crisp tables using the same patterns that are used in conventional querying.
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.
