Defining Rough Sets by Extended Logic Programs
Logic in Computer Science
2007-05-23 v1 Programming Languages
Abstract
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.
Cite
@article{arxiv.cs/0207089,
title = {Defining Rough Sets by Extended Logic Programs},
author = {Jan Małuszyński and Aida Vitória},
journal= {arXiv preprint arXiv:cs/0207089},
year = {2007}
}
Comments
10 pages. Originally published in proc. PCL 2002, a FLoC workshop; eds. Hendrik Decker, Dina Goldin, Jorgen Villadsen, Toshiharu Waragai (http://floc02.diku.dk/PCL/)