Defining Rough Sets by Extended Logic Programs
| dc.creator | Małuszyński, Jan | |
| dc.creator | Vitória, Aida | |
| dc.date | 2002-07-25 | |
| dc.date.accessioned | 2026-07-07T03:18:45Z | |
| dc.date.available | 2026-07-07T03:18:45Z | |
| dc.description | 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. | |
| dc.description | 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/) | |
| dc.identifier | https://arxiv.org/abs/cs/0207089 | |
| dc.identifier | http://arxiv.org/abs/cs/0207089 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/31238 | |
| dc.subject | Logic in Computer Science | |
| dc.subject | Programming Languages | |
| dc.subject | F.4.1; I.2.3; I.2.4; D.1.6 | |
| dc.title | Defining Rough Sets by Extended Logic Programs | |
| dc.type | text |