Related papers: Rough sets and three-valued structures
The present paper proposes a novel way to unify Rough Set Theory and Formal Concept Analysis. Our method stems from results and insights developed in the algebraic theory of modal logic, and is based on the idea that Pawlak's original…
We present a survey of recent results, scattered in a series of papers that appeared during past five years, whose common denominator is the use of cubic relations in various algebraic structures. Cubic (or ternary) relations can represent…
Taking an algebraic perspective on the basic structures of Rough Concept Analysis as the starting point, in this paper we introduce some varieties of lattices expanded with normal modal operators which can be regarded as the natural rough…
The objective of this paper is to describe the structure of Zariski closed algebras, which provide a useful generalization to finite dimensional algebras in the study of representable algebras over finite fields. Our results include a…
Rough sets induced by quasiorders appear in several constructions using binary relations in computer science. In this paper, a structural characterisation of rough sets induced by quasiorders is given. These rough sets form Nelson algebras…
In this paper, we study the category of trigroups as a generalization of the notion of digroup [4] and analyze their relationship with 3-racks [1] and Leibniz 3-algebras [6]. Trigroups are essentially associative trioids in which there are…
The class of skew lattices can be seen as an algebraic category. It models an algebraic theory in the category of Sets where the Green's relation D is a congruence describing an adjunction to the category of Lattices. In this paper we will…
We develop two algebraic semantics for bitten rough set theory (\cite{SW}) over similarity spaces and their abstract granular versions. Connections with choice based generalized rough semantics developed in \cite{AM69} by the present author…
The main goal of this paper, present the concepts of rough BO/BH/Z- Algebra as extended of the concept of BO/BH/Z-algebra respectively. The other goal is to consider the (strong) set-valued mapping in these algebraic structures. The concept…
Study of soft sets was first proposed by Molodtsov in 1999 to deal with uncertainty in a non-parametric manner. The researchers did not pay attention to soft set theory at that time but now the soft set theory has been developed in many…
Rough sets are efficient for data pre-processing in data mining. Matroids are based on linear algebra and graph theory, and have a variety of applications in many fields. Both rough sets and matroids are closely related to lattices. For a…
The notion of rough set captures indiscernibility of elements in a set. But, in many real life situations, an information system establishes the relation between different universes. This gave the extension of rough set on single universal…
Over the past 50 years, Nelson algebras have been extensively studied by distinguished scholars as the algebraic counterpart of Nelson's constructive logic with strong negation. Despite these studies, a comprehensive survey of the topic is…
Rough set theory is a new mathematical approach to imperfect knowledge. The notion of rough sets is generalized by using an arbitrary binary relation on attribute values in information systems, instead of the trivial equality relation. The…
Covering-based rough set theory is a useful tool to deal with inexact, uncertain or vague knowledge in information systems. Geometric lattice has widely used in diverse fields, especially search algorithm design which plays important role…
For several types of information relations, the induced rough sets system RS does not form a lattice but only a partially ordered set. However, by studying its Dedekind-MacNeille completion DM(RS), one may reveal new important properties of…
Covering is a common type of data structure and covering-based rough set theory is an efficient tool to process this data. Lattice is an important algebraic structure and used extensively in investigating some types of generalized rough…
In this article we survey recent results on rigid dualizing complexes over commutative algebras. We begin by recalling what are dualizing complexes. Next we define rigid complexes, and explain their functorial properties. Due to the…
3-Lie algebras have close relationships with many important fields in mathematics and mathematical physics. The paper concerns 3-Lie algebras. The concepts of 3-Lie coalgebras and 3-Lie bialgebras are given. The structures of such…
We study the relationship between singularity categories and relative singularity categories and discuss constructions of differential graded algebras of relative singularity categories. As consequences, we obtain structural results, which…