A generalized decision logic language for granular computing

Author

Yao, Y.Y.

Author_Institution

Dept. of Comput. Sci., Regina Univ., Sask.

Volume

1

fYear

2002

fDate

6/24/1905 12:00:00 AM

Firstpage

773

Lastpage

778

Abstract

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

Keywords

computability; decidability; decision theory; formal languages; fuzzy logic; fuzzy set theory; logic programming languages; GDL; Tarski style; concept extension; concept intension; decision rules; finite attribute set; formal concepts; generalized decision logic language; granular computing; granule description; granule interpretation; granule relationships; information table; satisfiability; Computer science; Data analysis; Databases; Fuzzy sets; Information analysis; Information science; Logic; Machine learning; Quantization; Set theory;

fLanguage

English

Publisher

ieee

Conference_Titel

Fuzzy Systems, 2002. FUZZ-IEEE'02. Proceedings of the 2002 IEEE International Conference on

Conference_Location

Honolulu, HI

Print_ISBN

0-7803-7280-8

Type

conf

DOI

10.1109/FUZZ.2002.1005091

Filename

1005091