2000 character limit reached
On a Well-behaved Relational Generalisation of Rough Set Approximations
Published 5 Dec 2016 in cs.AI | (1612.01857v2)
Abstract: We examine non-dual relational extensions of rough set approximations and find an extension which satisfies surprisingly many of the usual rough set properties. We then use this definition to give an explanation for an observation made by Samanta and Chakraborty in their paper [P. Samanta and M.K. Chakraborty. Interface of rough set systems and modal logics: A survey. Transactions on Rough Sets XIX, pages 114-137, 2015].
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.