79 research outputs found
Information completeness in Nelson algebras of rough sets induced by quasiorders
In this paper, we give an algebraic completeness theorem for constructive
logic with strong negation in terms of finite rough set-based Nelson algebras
determined by quasiorders. We show how for a quasiorder , its rough
set-based Nelson algebra can be obtained by applying the well-known
construction by Sendlewski. We prove that if the set of all -closed
elements, which may be viewed as the set of completely defined objects, is
cofinal, then the rough set-based Nelson algebra determined by a quasiorder
forms an effective lattice, that is, an algebraic model of the logic ,
which is characterised by a modal operator grasping the notion of "to be
classically valid". We present a necessary and sufficient condition under which
a Nelson algebra is isomorphic to a rough set-based effective lattice
determined by a quasiorder.Comment: 15 page
Representation of Nelson Algebras by Rough Sets Determined by Quasiorders
In this paper, we show that every quasiorder induces a Nelson algebra
such that the underlying rough set lattice is algebraic. We
note that is a three-valued {\L}ukasiewicz algebra if and only if
is an equivalence. Our main result says that if is a Nelson
algebra defined on an algebraic lattice, then there exists a set and a
quasiorder on such that .Comment: 16 page
Representative Set of Objects in Rough Sets Based on Galois Connections
This paper introduces a novel definition, called representative set of objects of a decision class, in the framework of decision systems based on rough sets. The idea behind such a notion is to consider subsets of objects that characterize the different classes given by a decision system. Besides the formal definition of representative set of objects of a decision class, we present different mathematical properties of such sets and a relationship with classification tasks based on rough sets. © 2020, Springer Nature Switzerland AG
Approximations from Anywhere and General Rough Sets
Not all approximations arise from information systems. The problem of fitting
approximations, subjected to some rules (and related data), to information
systems in a rough scheme of things is known as the \emph{inverse problem}. The
inverse problem is more general than the duality (or abstract representation)
problems and was introduced by the present author in her earlier papers. From
the practical perspective, a few (as opposed to one) theoretical frameworks may
be suitable for formulating the problem itself. \emph{Granular operator spaces}
have been recently introduced and investigated by the present author in her
recent work in the context of antichain based and dialectical semantics for
general rough sets. The nature of the inverse problem is examined from
number-theoretic and combinatorial perspectives in a higher order variant of
granular operator spaces and some necessary conditions are proved. The results
and the novel approach would be useful in a number of unsupervised and semi
supervised learning contexts and algorithms.Comment: 20 Pages. Scheduled to appear in IJCRS'2017 LNCS Proceedings,
Springe
Rough Sets Determined by Quasiorders
In this paper, the ordered set of rough sets determined by a quasiorder
relation is investigated. We prove that this ordered set is a complete,
completely distributive lattice. We show that on this lattice can be defined
three different kinds of complementation operations, and we describe its
completely join-irreducible elements. We also characterize the case in which
this lattice is a Stone lattice. Our results generalize some results of J.
Pomykala and J. A. Pomykala (1988) and M. Gehrke and E. Walker (1992) in case
is an equivalence.Comment: 18 pages, major revisio
Traumi oculari da tappo di bottiglia: studio clinico ed epidemiologico
Valutazione clinico-epidemiologica dei traumi oculari da tappo di bottiglia
- …