A generalized decision logic language for granular computing
Yiyu Y. Yao · 2003
A generalized decision logic (GDL) language is proposed for granular computing (GrC) in Tarski's style through the notions of a model and satisfiability. The model is an information table consisting of a finite set of objects described by a finite set Of attributes. A concept or a granule is characterized by a pair consisting of the intension of the concept, a formula of the language GDL, and the extension of the concept, a subset of the universe. We discuss the application of GDL in formal concepts and decision rules. The former deals with the description and interpretation of granules, and the latter deals with the relationships between granules.