A LOGICAL FORMULATION OF ROUGH SET DEFINABILITY

Abstract

In data mining problems, data is usually provided in the form of data tables. To represent knowledge discovered from data tables, a decision logic (DL) is proposed in rough set theory. DL, is an instance of propositional logic, but we can use other logical formalisms to describe data tables. In this paper, we propose two descriptions of data tables based on first-order data logic (FOUL) and attribute value-sorted logic (AVSL) respectively. In the context of FODL, we show that explicit, definability and implicit definability in classical logic implies the notion of definability in rough set theory. We also show that AVSL is particularly useful for the representation of properties of many-valued data tables.