7,545 research outputs found
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
Stone-type representations and dualities for varieties of bisemilattices
In this article we will focus our attention on the variety of distributive
bisemilattices and some linguistic expansions thereof: bounded, De Morgan, and
involutive bisemilattices. After extending Balbes' representation theorem to
bounded, De Morgan, and involutive bisemilattices, we make use of Hartonas-Dunn
duality and introduce the categories of 2spaces and 2spaces. The
categories of 2spaces and 2spaces will play with respect to the
categories of distributive bisemilattices and De Morgan bisemilattices,
respectively, a role analogous to the category of Stone spaces with respect to
the category of Boolean algebras. Actually, the aim of this work is to show
that these categories are, in fact, dually equivalent
- …