Defining Rough Sets by Extended Logic Programs

Details Defining Rough Sets by Extended Logic Programs Defining Rough Sets by Extended Logic Programs

2002-07-25

arxiv.org/abs/cs/0207089v1

Computer Science

Logic in Computer Science

10 pages. Originally published in proc. PCL 2002, a FLoC workshop; eds. Hendrik Decker, Dina Goldin, Jorgen Villadsen, Toshiha

Scientific paper

We show how definite extended logic programs can be used for defining and reasoning with rough sets. Moreover, a rough-set-specific query language is presented and an answering algorithm is outlined. Thus, we not only show a possible application of a paraconsistent logic to the field of rough sets as we also establish a link between rough set theory and logic programming, making possible transfer of expertise between both fields.

Affiliated with

Also associated with

No associations

Rating

Defining Rough Sets by Extended Logic Programs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Defining Rough Sets by Extended Logic Programs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Defining Rough Sets by Extended Logic Programs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-226632