Logics for Rough Concept Analysis

11/17/2018
by   Giuseppe Greco, et al.
0

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 algebra counterparts of certain subclasses of rough formal contexts, and introduce proper display calculi for the logics associated with these varieties which are sound, complete, conservative and with uniform cut elimination and subformula property. These calculi modularly extend the multi-type calculi for rough algebras to a `nondistributive' (i.e. general lattice-based) setting.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/30/2019

Rough concepts

The present paper proposes a novel way to unify Rough Set Theory and For...
research
10/12/2018

Rough Concept Analysis

The theory introduced, presented and developed in this paper, is concern...
research
01/04/2020

Restricted Rules of Inference and Paraconsistency

We present here two logical systems - intuitionistic paraconsistent weak...
research
12/05/2016

On a Well-behaved Relational Generalisation of Rough Set Approximations

We examine non-dual relational extensions of rough set approximations an...
research
07/06/2016

Lattice Structure of Variable Precision Rough Sets

The main purpose of this paper is to study the lattice structure of vari...
research
05/19/2019

Rough sets and three-valued structures

In recent years, many papers have been published showing relationships b...
research
08/09/2011

A Knowledge Mining Model for Ranking Institutions using Rough Computing with Ordering Rules and Formal Concept analysis

Emergences of computers and information technological revolution made tr...

Please sign up or login with your details

Forgot password? Click here to reset