Computing Reviews

From rough sets to rough knowledge bases
Vitória A., Damásio C., Maluszyński J. Fundamenta Informaticae57(2-4):215-246,2003.Type:Article
Date Reviewed: 07/08/04

A language for knowledge representation with vague concepts is introduced in this paper, based on the formalism of rough sets, and a semantics borrowed from the logic programming community, namely, paraconsistent stable models of extended logic programs.

The translation of a rough program into an EP is made by two transformations that capture the essence of upper and lower approximations, in terms of literals with both the explicit and the default negation.

The paper is self-contained, including the basics of rough sets and logic programming needed to understand its main results. Regarding the overall contribution of the paper, it is a substantially extended version of a conference paper by the authors; specifically, a completely new semantics has been introduced. A set of examples, adequately chosen, help the reader to grasp the definitions introduced.

The section of application examples demonstrates that some useful techniques introduced previously in an ad hoc way are naturally expressible in the proposed language, an important feature of the paper.

My overall impression of this work is very positive; the connection shown between rough sets and extended logic programs is certainly promising.

Reviewer:  Manuel Ojeda Aciego Review #: CR129866 (0501-0102)

Reproduction in whole or in part without permission is prohibited.   Copyright 2024 ComputingReviews.com™
Terms of Use
| Privacy Policy