Defining Rough Sets by Extended Logic Programs

TL;DR

This paper introduces a novel approach to defining and reasoning with rough sets using extended logic programs, establishing a link between rough set theory and logic programming, and presenting a specialized query language and answering algorithm.

Contribution

It demonstrates how definite extended logic programs can be used for rough set definition and reasoning, and introduces a rough-set-specific query language and algorithm.

Findings

Establishes a connection between rough set theory and logic programming.

Proposes a query language tailored for rough sets.

Outlines an answering algorithm for rough-set queries.

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.