Logics for rough concept analysis

None, None; None, None; None, None; None, None; None, None

Logics for rough concept analysis

Conference Paper (2019)

Author(s)

Giuseppe Greco (Universiteit Utrecht)

Peter Jipsen (Chapman University)

Krishna Manoorkar (Indian Institute of Technology Kanpur)

Alessandra Palmigiano (TU Delft - Technology, Policy and Management, University of Johannesburg)

Apostolos Tzimoulis (Chapman University)

Research Group

Ethics & Philosophy of Technology

Modal logic Proper display calculi Algebras for rough sets Formal Concept Analysis Lattice-based logics Rough set theory

DOI related publication

https://doi.org/10.1007/978-3-662-58771-3_14 Final published version

To reference this document use

https://resolver.tudelft.nl/uuid:afd29f9e-fa9f-4f34-88f4-4b7799cc4b66

More Info

expand_more

Publication Year

2019

Language

English

Research Group

Ethics & Philosophy of Technology

Pages (from-to)

144-159

Publisher

Springer

ISBN (print)

978-3-662-58770-6

ISBN (electronic)

978-3-662-58771-3

Event

8th Indian Conference on Logic and Its Applications, ICLA 2019 (2019-03-03 - 2019-03-05), Delhi, India

Downloads counter

179

Abstract

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.