標題: Definability in Logic and Rough Set Theory
作者: Fan, Tuan-Fang
Liau, Churn-Jung
Liu, Duen-Ren
資訊管理與財務金融系 註:原資管所+財金所
Department of Information Management and Finance
公開日期: 1-Jan-2008
摘要: 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.
URI: http://dx.doi.org/10.3233/978-1-58603-891-5-749
http://hdl.handle.net/11536/146260
ISSN: 0922-6389
DOI: 10.3233/978-1-58603-891-5-749
期刊: ECAI 2008, PROCEEDINGS
Volume: 178
起始頁: 749
Appears in Collections:Conferences Paper