𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A logic for rough sets

✍ Scribed by Ivo Düntsch

Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
575 KB
Volume
179
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

✦ Synopsis

The collection of all subsets of a set forms a Boolean algebra under the usual set-theoretic operations, while the collection of rough sets of an approximation space is a regular double Stone algebra (Pomykala and Pomykala, 1988). The appropriate class of algebras for classical propositional logic are Boolean algebras, and it is reasonable to assume that regular double Stone algebras are a class of algebras appropriate for a logic of rough sets. Using the representation theorem for these algebras by Katri%k (1974), we present such a logic for rough sets and its algebraic semantics in the spirit of Andrtka and NCmeti (1994).

📜 SIMILAR VOLUMES

Rough Sets and 3-Valued Logics
Rough Sets and 3-Valued Logics
✍ A. Avron; B. Konikowska 📂 Article 📅 2008 🏛 Springer Netherlands 🌐 English ⚖ 301 KB
Axiomatics for fuzzy rough sets
Axiomatics for fuzzy rough sets
✍ Nehad N. Morsi; M.M. Yakout 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 580 KB

A fuzzy T-rough set consists of a set X and a T-similarity relation R on X, where T is a lower semi-continuous triangular norm. We generalize the Farinas-Prade definition for the upper approximation operator A: I x --+ IX of a fuzzy T-rough set (X, R); given originally for the special case T = Min,

Criteria for choosing a rough set model
Criteria for choosing a rough set model
✍ Joseph P. Herbert; JingTao Yao 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 576 KB

One of the challenges a decision maker faces in using rough sets is to choose a suitable rough set model for data analysis. We investigate how two rough set models, the Pawlak model and the probabilistic model, influence the decision goals of a user. Two approaches use probabilities to define region