Category-Based Rough Induction

Authors:
Marcin Wolski
Affiliations:
Department of Logic and Methodology of Science, Maria Curie-Skłodowska University, Poland
Venue:
RSEISP '07 Proceedings of the international conference on Rough Sets and Intelligent Systems Paradigms
Year:
2007

Citing 2
Cited 1

Tolerance approximation spaces

Fundamenta Informaticae - Special issue: rough sets
Rough Sets: Theoretical Aspects of Reasoning about Data

Rough Sets: Theoretical Aspects of Reasoning about Data

Satisfiability of Formulas from the Standpoint of Object Classification: The RST Approach

Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)

Quantified Score

Hi-index	0.01

Visualization

Abstract

The present paper is concerned with Rough Set Theory (RST) and Similarity Coverage Model (SCM) of category-based induction. It redefines basic concepts of RST in the light of SCM, and explains how RST may be seen as an elegant formal model of inductive reasoning. Furthermore, following SCM, we enrich RST by the concept of an ontology defined as a subset of the family of all definable sets. The paper also presents a model of inductive reasoning which is driven by recent works on RST and nearness-type structures. We show how approximation spaces can be characterised in terms of non-Archimedean nearness spaces.