# Algebraic Semantics of Generalized RIFs

@article{Mani2021AlgebraicSO, title={Algebraic Semantics of Generalized RIFs}, author={Ajay Mani}, journal={ArXiv}, year={2021}, volume={abs/2109.12998} }

A number of numeric measures like rough inclusion functions (RIFs) are used in general rough sets and soft computing. But these are often intrusive by definition, and amount to making unjustified assumptions about the data. The contamination problem is also about recognizing the domains of discourses involved in this, specifying errors and reducing data intrusion relative to them. In this research, weak quasi rough inclusion functions (wqRIFs) are generalized to general granular operator spaces… Expand

#### References

SHOWING 1-10 OF 52 REFERENCES

Knowledge and Consequence in AC Semantics for General Rough Sets

- Computer Science
- 2017

The epistemological aspects of the semantics are studied in this chapter in some depth and revolve around nature of knowledge representation, Peircean triadic semiotics and temporal aspects of parthood. Expand

Functional Extensions of Knowledge Representation in General Rough Sets

- Computer Science
- IJCRS
- 2020

This research investigates ternary functional relationships in rough sets from a minimalist perspective, and granular operator spaces and variants are shown to be representable as partial algebras through the method. Expand

Probabilities, dependence and rough membership functions

- Computer Science
- 2017

A new theory of dependence based deviant probability is developed as a severe extension of the axiomatic approach to a dependence-based probability introduced recently by the present author and permits clearer comparison of the concept with those of rough dependence. Expand

Generalized Ideals and Co-Granular Rough Sets

- Mathematics, Computer Science
- IJCRS
- 2017

This research will be of relevance for a number of logico-algebraic approaches to rough sets that proceed from point-wise definitions of approximations and also for using alternative approximation in spatial mereological contexts involving actual contact relations. Expand

Dialectics of Counting and the Mathematics of Vagueness

- Mathematics, Computer Science
- Trans. Rough Sets
- 2012

New concepts of rough natural number systems are introduced in this research paper from both formal and less formal perspectives and it is shown that algebraic semantics of classical RST can be obtained from the developed dialectical counting procedures. Expand

Contamination-free measures and algebraic operations

- Computer Science
- 2013 IEEE International Conference on Fuzzy Systems (FUZZ-IEEE)
- 2013

Methods and semantics for handling possibly contaminated operations and structured bigness are proposed and would also be of natural interest for relative consistency of one collection of knowledge relative other. Expand

Pure rough mereology and counting

- Computer Science, Mathematics
- 2016 IEEE International WIE Conference on Electrical and Computer Engineering (WIECON-ECE)
- 2016

A general rough set framework called granular operator spaces is extended and the nature of parthood in it is explored from a minimally intrusive point of view to develop counting strategies that help in classifying the framework. Expand

Algebraic Methods for Granular Rough Sets

- Computer Science
- 2018

The axiomatic approach in algebraic approaches to general rough sets had been introduced in an explicit formal way by the present author and most of the results and techniques that are granular in this sense are considered critically in some detail in this research chapter. Expand

Dialectical Rough Sets, Parthood and Figures of Opposition

- Mathematics, Computer Science
- Trans. Rough Sets
- 2019

D dialectical rough logics are invented from a semantic perspective, a concept of dialectical predicates is formalised, connection with dialetheias and glutty negation are established, and parthood is analyzed and studied from the viewpoint of classical and dialectical figures of opposition by the present author. Expand

Antichain Based Semantics for Rough Sets

- Computer Science
- RSKT
- 2015

It is shown that even when the approximation operators are poorly behaved, some semantics with good structure and computational potential can be salvaged. Expand