Granules and reasoning based on granular computing

Authors:
Qing Liu
Affiliations:
Department of Computer Science, Nanchang University, Nanchang
Venue:
IEA/AIE'2003 Proceedings of the 16th international conference on Developments in applied artificial intelligence
Year:
2003

Citing 2
Cited 3

First-order rough logic I: approximate reasoning via rough sets

Fundamenta Informaticae - Special issue: rough sets
The OI-Resolution of Operator Rough Logic

RSCTC '98 Proceedings of the First International Conference on Rough Sets and Current Trends in Computing

Theoretical study of granular computing

RSKT'06 Proceedings of the First international conference on Rough Sets and Knowledge Technology
The research of rough sets in normed linear space

RSCTC'06 Proceedings of the 5th international conference on Rough Sets and Current Trends in Computing
Granular logic with closeness relation "∼λ" and its reasoning

RSFDGrC'05 Proceedings of the 10th international conference on Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing - Volume Part I

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper discusses the granules and granular computing. The granule of decision rules is defined. The inclusion and closeness degree between granules are also defined. A new reasoning model is proposed. The reasoning model may be used in reasoning of expert systems. Granule is thought as a pair $(\varphi, d (\varphi))$, it is the both logic and set theory. Where $\varphi$ may be a formula in rough logic or in classical logic or in any non-standard logic, $d(\varphi)$ is the interpretation domain of formula $\varphi$, The pair $(\varphi, d(\varphi))$ is called an elementary granule. Finally, the validity and feasibility of the reasoning model are illustrated with real examples. Related theorems and its proofs are discussed.