On the completion of rough sets system determined by arbitrary binary relations

DOI10.3233/FI-2015-1188MaRDI QIDQ2805437zbMATH OpenFDO

Authors Dwaraganathan Umadevi

Publication date 11 May 2016

Published in Fundamenta Informaticae (Search for Journal in Brave)

zbMATH Keywords

rough setsposetcomplete latticecompletion of a poset

Mathematics Subject Classification ID

Partial orders, general (06A06) Knowledge representation (68T30) Complete lattices, completions (06B23)

Recommendations

• Rough Sets and Current Trends in Computing
• Information completeness in Nelson algebras of rough sets induced by quasiorders
• Rough sets determined by quasiorders
• Publication:4892376
• Approximations of arbitrary binary relations by partial orders: classical and rough set models

Cited in

(4)

• Pseudo-Kleene algebras determined by rough sets
• Nelson algebras, residuated lattices and rough sets: A survey
• Information completeness in Nelson algebras of rough sets induced by quasiorders
• Algebraic representation, dualities and beyond

This page was built for publication: On the completion of rough sets system determined by arbitrary binary relations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2805437)