Aida Vitória:
James F. Peters, Andrzej Skowron (editors):
A Framework for Reasoning with Rough Sets.

Transactions on Rough Sets IV, LNCS 3700, 178-276, July 2005
© Springer

Rough sets framework has two appealing aspects. First, it is a mathematical approach to deal with vague concepts. Second, rough set techniques can be used in data analysis to find patterns hidden in the data. The number of applications of rough sets to practical problems in different fields demonstrates the increasing interest in this framework and its applicability. This thesis1 proposes a language that caters for implicit definitions of rough sets obtained by combining different regions of other rough sets. In this way, concept approximations can be derived by taking into account domain knowledge. A declarative semantics for the language is also discussed. It is then shown that programs in the proposed language can be compiled to extended logic programs under the paraconsistent stable model semantics. The equivalence between the declarative semantics of the language and the declarative semantics of the compiled programs is proved. This transformation provides the computational basis for implementing our ideas. A query language for retrieving information about the concepts represented through the defined rough sets is also discussed. Several motivating applications are described. Finally, an extension of the proposed language with numerical measures is presented. This extension is motivated by the fact that numerical measures are an important aspect in data mining applications.



	author = {Aida Vitória},
	title = {A Framework for Reasoning with Rough Sets},
	journal = {},
	year = {2005},
	volume = {3700},
	pages = {178--276},
	url = {}