Abstract
Domain Theory and Rough Set Theory are relatively independent but have much close relationship worthy of further investigation. In this paper, we propose the notion of (orientated) lower concept formula (for short, lcf) of relational information systems and study the order-theoretic properties of the derived lcf systems. Particularly, we show that every orientated lcf system is an algebraic lattice and conversely every algebraic lattice is order-isomorphic to the orientated lcf system of an appropriate relational information system. Moreover, we obtain the one-to-one correspondence between approximable mappings and Scott continuous functions. In addition, we investigate the connection between the orientated lcf systems on the relational information systems and the topped $$\bigcap $$ ? -structures on the lower concept lattices. Our results demonstrate the power of Rough Set Theory in studying domain structures.
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.
