ROUGH LATTICE OVER BOOLEAN ALGEBRA

− Rough Set Theory (RST) is a mathematical formalism for representing uncertainty thatcan be considered as an extension of the classical set theory. It has been used in many differentresearch areas, including those related to inductive machine learning and reduction of knowledge inknowledge-based sy...

Full description

Saved in:
Bibliographic Details
Main Authors: Dipankar Rana, Sankar Kumar Roy
Format: Article
Language:English
Published: Naim Çağman 2015-03-01
Series:Journal of New Theory
Subjects:
Online Access:https://dergipark.org.tr/en/download/article-file/407359
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1849723872978403328
author Dipankar Rana
Sankar Kumar Roy
author_facet Dipankar Rana
Sankar Kumar Roy
author_sort Dipankar Rana
collection DOAJ
description − Rough Set Theory (RST) is a mathematical formalism for representing uncertainty thatcan be considered as an extension of the classical set theory. It has been used in many differentresearch areas, including those related to inductive machine learning and reduction of knowledge inknowledge-based systems. Rough partial order relation and rough lattice are two important conceptsto introduce here based on RST. This paper provides some properties of rough relations, rough lattice,rough boolean lattice and established their validity. Some results are established to illustrate the paper
format Article
id doaj-art-5dfcef86e94d4b36b4efdab2fccfd9b2
institution DOAJ
issn 2149-1402
language English
publishDate 2015-03-01
publisher Naim Çağman
record_format Article
series Journal of New Theory
spelling doaj-art-5dfcef86e94d4b36b4efdab2fccfd9b22025-08-20T03:10:54ZengNaim ÇağmanJournal of New Theory2149-14022015-03-01263682425ROUGH LATTICE OVER BOOLEAN ALGEBRADipankar RanaSankar Kumar Roy− Rough Set Theory (RST) is a mathematical formalism for representing uncertainty thatcan be considered as an extension of the classical set theory. It has been used in many differentresearch areas, including those related to inductive machine learning and reduction of knowledge inknowledge-based systems. Rough partial order relation and rough lattice are two important conceptsto introduce here based on RST. This paper provides some properties of rough relations, rough lattice,rough boolean lattice and established their validity. Some results are established to illustrate the paperhttps://dergipark.org.tr/en/download/article-file/407359− rough setrough approximationboolean algebrarough relationrough partialorderboolean lattice
spellingShingle Dipankar Rana
Sankar Kumar Roy
ROUGH LATTICE OVER BOOLEAN ALGEBRA
Journal of New Theory
− rough set
rough approximation
boolean algebra
rough relation
rough partialorder
boolean lattice
title ROUGH LATTICE OVER BOOLEAN ALGEBRA
title_full ROUGH LATTICE OVER BOOLEAN ALGEBRA
title_fullStr ROUGH LATTICE OVER BOOLEAN ALGEBRA
title_full_unstemmed ROUGH LATTICE OVER BOOLEAN ALGEBRA
title_short ROUGH LATTICE OVER BOOLEAN ALGEBRA
title_sort rough lattice over boolean algebra
topic − rough set
rough approximation
boolean algebra
rough relation
rough partialorder
boolean lattice
url https://dergipark.org.tr/en/download/article-file/407359
work_keys_str_mv AT dipankarrana roughlatticeoverbooleanalgebra
AT sankarkumarroy roughlatticeoverbooleanalgebra