Vitoria, Aida Maluszynski, Jan Szalas, Andrzej 2009 (English)In: Fundamenta Informaticae, ISSN 0169-2968, Vol. 97, no 4, 405-438Article in journal (Refereed) Published
We present a language for defining paraconsistent rough sets and reasoning about them. Our framework relates and brings together two major fields: rough sets  and paraconsistent logic programming . To model inconsistent and incomplete information we use a four-valued logic. The language discussed in this paper is based on ideas of our previous work [21, 32, 22] developing a four-valued framework for rough sets. In this approach membership function, set containment and set operations are four-valued, where logical values are t (true), f (false), i (inconsistent) and u (unknown). We investigate properties of paraconsistent rough sets as well as develop a paraconsistent rule language, providing basic computational machinery for our approach.
approximate reasoning, rough sets, paraconsistent reasoning, four-valued logics
National CategoryEngineering and Technology
Identifiersurn:nbn:se:liu:diva-53059 (URN)10.3233/FI-2009-209 (DOI)oai:DiVA.org:liu-53059 (OAI)diva2:286646 (DiVA)