Approximations on normal forms in rough-fuzzy predicate calculus

0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Considering the importance of Pawlak’s Rough Set Model in information systems, in 2005, G. Ganesan discussed the rough approximations on fuzzy attributes of the information systems. In 2008, G. Ganesan et al., have introduced Rough-Fuzzy connectives confining to the information system as a logical system with fuzzy membership values. In this paper, a two way approach on normal forms through the Rough-Fuzzy connectives using lower and upper literals is discussed.

Cite

CITATION STYLE

APA

Satish, B. N. V., & Ganesan, G. (2015). Approximations on normal forms in rough-fuzzy predicate calculus. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9436, pp. 369–380). Springer Verlag. https://doi.org/10.1007/978-3-319-25754-9_33

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free