Defining Rough Sets by Extended Logic Programs
<|reference_start|>Defining Rough Sets by Extended Logic Programs: 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.<|reference_end|>
@article{małuszyński2002defining,
    title={Defining Rough Sets by Extended Logic Programs},
    author={Jan Ma{l}uszy'nski and Aida Vit'oria (Link"oping University,
  Sweden)},
    journal={arXiv preprint arXiv:cs/0207089},
    year={2002},
    archivePrefix={arXiv},
    eprint={cs/0207089},
    primaryClass={cs.LO cs.PL}
}