@INPROCEEDINGS { Rsds4631,
author = {Semeniuk-Polkowska, Maria and Polkowski, Lech T.}, 
title = {Rough mereological logics with applications to approximate reasoning}, 
booktitle = {Procedings of the Workshop in Concurrency, Specification and Programming (CS&P'2008)}, 
series =  = {Informatik Berichte Nr. 225}, 
volume = 3, 
pages = {471--479}, 
publisher = {Humboldt Universitat zu Berlin}, 
address = {Berlin, Germany}, 
month = {September}, 
year = 2008, 
editor = {Lindemann, Gabriela and Schlingloff, Holger and Burkhard, Hans Dieter and Czaja, Ludwik and Penczek, Wojciech and Salwicki, Andrzej and Skowron, Andrzej and Suraj, Zbigniew}, 
abstract = {Approximate reasoning is intimately tied to real phenomena as it aims at finding schemes for reasoning that explain as well as possible real phenomena, in particular, classification of real objects into categories. Among many reasoning schemes, submitted by various paradigms, we adhere to rough mereological logics constructed in the frame of rough mereology; those are intensional manyâ€“valued logics and they offer interesting applications via granulation mechanisms to analysis of data. Presentation of those logics and contexts in which they can be applied is the aim of this work.}, 
keywords = {rough mereology, rough inclusions, rough mereological logics, granulation of knowledge, rule–based classifiers, }, 
}