Logics from Rough Sets

Schedule

9.30-10.00: Inaugural address (MK Chakraborty)

10-11: Keynote 1 (A Szalas)

11-11.30: Coffee break

11.30-12: Contributory 1 (P Pagliani)

12-12.30: Contributory 2 (AK More)

12.30-13h00: Contributory 3 (G Panicker)

13h-14h Lunch

14-15: Keynote 2 (M Banerjee)

15-15h30: Contributory 4 (P Howlader)

15.30-16h: Coffee break

16h-16h30: Contributory 5 (T Kadek)

16h30-17h: General discussion with participants


ORGANIZER

School of Cognitive Science,

Jadavpur university, Kolkata

India



KEYNOTE SPEAKERS

Faculty of Mathematics, Informatics and Mechanics, University of Warsaw, Poland

Dept. of Computer and Information Science, Linköpings University, Sweden

"Calculating Logical Constraints on Approximation Spaces".



Department of Mathematics and Statistics

Indian Institute of Technology

Kanpur, India

"Logics from Algebras on Rough Sets"





Rough Sets were introduced by Polish computer scientist Z. Pawlak in the year 1982. The objective was knowledge representation and data processing from the angle of computation and decision making. The main idea is to approximate the extension of a concept by two subsets of the universe of discourse, namely, lower and upper approximations. Various types of algebras on the power set of the universe with lower/upper approximation operators were soon proposed, and algebraic studies have since formed an important branch of research for rough set theory. Parallel to this, came into existence the study of logics generated by rough sets, developing over the years in multiple directions.

Logics from rough sets may be divided broadly into two groups: algebraic and modal. In the first,logics are rendered with algebraic semantics where the algebras are abstractions from rough set models. Amongst these algebras, a notable one that has seen a lot of investigation, is the topological quasi-Boolean algebra and algebras related to it. The direction of research includes a study of representation theorems for the abstract algebraic structures in terms of rough set structures, and their subsequent use in formulating a rough set semantics for the corresponding logics. In the second group, various modal logic systems are developed depending upon the properties of the lower/upper approximation operators. Such studies attained a peak with modal logic systems generated from covering based rough sets. These may be compared with neighbourhood–semantics of modal systems. However, several new kinds of modal logic systems, including non-standard ones, have been proposed from rough set models. Interplay between modal systems and rough set theory has thus become a significant area of research.

Yet a third type of development has taken place in which the consequence relation has been generalized to what has been called the rough consequence relation based on rough modus ponens rules. Besides, an axiomatic approach for rough consequence has been developed. These generalized consequence relations have direct implications in approximate reasoning

In the workshop we would like to have most of the above-mentioned streams of research represented but not limited to these only. Any kind of logic related with rough sets will be accommodated.

CALL FOR PAPERS

Relevant topics include (but are not restricted to):


  • Rough set semantics for modal logics

  • Interplay of rough sets and modal logics

  • Categories of rough sets

  • Rough sets and algebraic logic

  • Rough quantifiers

  • Rough modus ponens rules and rough consequence

To submit a contribution, please send an abstract (max 500 words) to: mihirc4@gmail.com

The participants of this workshop are welcome to submit the full version of their papers to a special issue of Transactions on Rough Sets (Springer). Be in touch with the organizer.

IMPORTANT DATES

Submission: September 30, 2021

Notification: October 8, 2021

Worskhop: 6-11 April , 2022 (the workshop will take place at some point during the UNILOG congress).