On Granular Computing and a Constraint Satisfaction Problem in Tables

Abstract

We consider a constraint satisfaction problem in tables. For solving this constraint satisfaction problem, we cope with some methods, i.e., an enumeration method, a search method, a granular computing method and a combined method. The granular computing method follows the rough sets based method in tables, and we show each property in every method. According to this attempt, we try to apply rough sets to solving constraint satisfaction problems.