Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Issue title: Concurrency, Specification, and Programming: Special Issue of Selected Papers of CS&P 2017
Guest editors: Wojciech Penczek, Holger Schlingloff and Piotr Wasilewski
Article type: Research Article
Authors: Wolski, Marcina; † | Gomolińska, Annab
Affiliations: [a] Maria Curie-Skłodowska University, Department of Logic and Cognitive Science, Maria Curie-Skłodowska Sq. 4, 20-031 Lublin, Poland. marcin.wolski@umcs.lublin.pl | [b] University of Białystok, Faculty of Mathematics and Informatics, Konstantego Ciołkowskiego 1M, 15-245 Białystok, Poland. anna.gom@math.uwb.edu.pl
Correspondence: [†] Address for correspondence: Maria Curie-Skłodowska University, Department of Logic and Cognitive Science, Maria Curie-Skłodowska Sq. 4, 20-031 Lublin, Poland
Note: [*] The paper is an extended and revised version of our talk which was presented at the international workshop Concurrency, Specification & Programming, held on 25 – 27 September 2017 in Warsaw.
Abstract: Pattern structures were introduced by Ganter and Kuznetsov in the framework of formal concept analysis (FCA) as a mean to direct analysis of objects having complex descriptions, e.g., descriptions presented in the form of graphs instead of a set of properties. Pattern structures actually generalise/replace the original FCA representation of the initial information about objects, that is, formal contexts (which form a special type of data tables); as a consequence, pattern structures are regarded in FCA as given (in some sense a priori to the analysis) rather than built (a posteriori) from data. The main goal of this paper is twofold: firstly, we would like to export the idea of pattern structures to and consistently with the framework/methodology of rough set theory (RST); secondly, we want to derive pattern structures from simple data tables rather than to regard them as the initial information about objects. To this end we present and discuss two methods of generating non-trivial pattern structures from simple information systems/tables. Both methods are inspired by near set theory, which is a methodology theoretically close to rough set theory, but developed in the topological settings of (descriptive) nearness of sets. Interestingly, these methods bear formal connections to other ideas from RST such as generalised decisions or symbolic value grouping.
Keywords: rough set theory, formal concept analysis, near set theory, pattern structures
DOI: 10.3233/FI-2019-1790
Journal: Fundamenta Informaticae, vol. 165, no. 3-4, pp. 363-380, 2019
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
sales@iospress.com
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
info@iospress.nl
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office info@iospress.nl
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
china@iospress.cn
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
如果您在出版方面需要帮助或有任何建, 件至: editorial@iospress.nl