Definability in Logic and Rough Set Theory

被引：0
|
作者：
Fan, Tuan-Fang [1 ,2 ]
Liau, Churn-Jung [3 ]
Liu, Duen-Ren [2 ]
机构：
[1] Natl Penghu Univ, Dept Comp Sci & Informat Engn, Penghu 880, Taiwan
[2] Natl Chiao Tung Univ, Inst Informat Management, Hsinchu 300, Taiwan
[3] Acad Sinica, Inst Informat Sci, Taipei 115, Taiwan
来源：
ECAI 2008, PROCEEDINGS | 2008年 / 178卷
关键词：
D O I：
10.3233/978-1-58603-891-5-749
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
Rough set theory is an effective tool for data mining. According to the theory, a concept is definable if it can be written as a Boolean combination of equivalence classes induced from classification attributes. On the other hand, definability in logic has been explicated by Beth's theorem. In this paper, we propose two data representation formalisms, called first-order data logic (FODL) and attribute value-sorted logic (AVSL), respectively. Based on these logics, we explore the relationship between logical definability and rough set definability.
引用
收藏
页码：749 / +
页数：2
相关论文
共 50 条
12345