Rough Sets and Sorites Paradox

Issue title: Concurrency, Specification, and Programming: Special Issue of Selected Papers of CS&P 2016

Guest editors: Ludwik Czaja, Wojciech Penczek, Holger Schlingloff and Nguyen Hung Son

Article type: Research Article

Authors: Jankowski, Andrzej^a | Skowron, Andrzej^{b; c; *} | Wasilewski, Piotr^d

Affiliations: [a] The Dziubanski Foundation of Knowledge Technology, Nowogrodzka 31, 00-511 Warsaw, Poland. [email protected] | [b] Institute of Mathematics, The University of Warsaw, Banacha 2, 02-097 Warsaw, Poland. [email protected] | [c] Systems Research Institute Polish Academy of Sciences, Newelska 6, 01-447 Warsaw, Poland | [d] Institute of Informatics, The University of Warsaw, Banacha 2, 02-097 Warsaw, Poland. [email protected]

Correspondence: [*] Address for correspondence: Institute of Mathematics, The University of Warsaw, Banacha 2, 02-097 Warsaw, Poland

Abstract: We discuss the rough set approach to approximation of vague concepts. There are already published several papers on rough sets and vague concepts staring from the seminal papers by Zdzisław Pawlak. However, only a few of them are discussing the relationships of rough sets with the sorites paradox. This paper contains a continuation of discussion on this issue.

Keywords: vagueness, vague concept, sorites paradox, (adaptive) rough set

DOI: 10.3233/FI-2018-1633

Journal: Fundamenta Informaticae, vol. 157, no. 4, pp. 371-384, 2018