Logics for Rough Concept Analysis

G. Greco, Peter Jipsen, Krishna Manoorkar, Alessandra Palmigiano

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

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.
Original languageEnglish
Title of host publicationLogic and its applications
Subtitle of host publication8th Indian Conference, ICLA 2019, Delhi, India, March 1-5, 2019, proceedings
EditorsA. Khan, A. Manuel
Place of PublicationBerlin
PublisherSpringer
Pages144-159
Number of pages16
Volume11600
EditionLNCS
ISBN (Electronic)9783662587713
ISBN (Print)9783662587706
DOIs
Publication statusPublished - 2019

Publication series

NameLecture notes in computer science
Volume11600

Keywords

  • Rough set theory
  • formal concept analysis
  • modal logic
  • lattice-based logics
  • algebras for rough sets
  • proper display calculi

Fingerprint

Dive into the research topics of 'Logics for Rough Concept Analysis'. Together they form a unique fingerprint.

Cite this