{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T21:16:21Z","timestamp":1648847781452},"reference-count":5,"publisher":"World Scientific Pub Co Pte Lt","issue":"01","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Unc. Fuzz. Knowl. Based Syst."],"published-print":{"date-parts":[[2011,2]]},"abstract":"<jats:p> In data mining problems, data is usually provided in the form of data tables. To represent knowledge discovered from data tables, a decision logic (DL) is proposed in rough set theory. DL is an instance of propositional logic, but we can use other logical formalisms to describe data tables. In this paper, we propose two descriptions of data tables based on first-order data logic (FODL) and attribute value-sorted logic (AVSL) respectively. In the context of FODL, we show that explicit definability and implicit definability in classical logic implies the notion of definability in rough set theory. We also show that AVSL is particularly useful for the representation of properties of many-valued data tables. <\/jats:p>","DOI":"10.1142\/s0218488511006861","type":"journal-article","created":{"date-parts":[[2011,1,19]],"date-time":"2011-01-19T11:36:16Z","timestamp":1295436976000},"page":"27-37","source":"Crossref","is-referenced-by-count":1,"title":["A LOGICAL FORMULATION OF ROUGH SET DEFINABILITY"],"prefix":"10.1142","volume":"19","author":[{"given":"TUAN-FANG","family":"FAN","sequence":"first","affiliation":[{"name":"Department of Computer Science and Information Engineering, National Penghu University, Penghu 880, Taiwan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"CHURN-JUNG","family":"LIAU","sequence":"additional","affiliation":[{"name":"Institute of Information Science, Academia Sinica, Taipei 115, Taiwan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"DUEN-REN","family":"LIU","sequence":"additional","affiliation":[{"name":"Institute of Information Management, National Chiao-Tung University, Hsinchu 300, Taiwan"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2011,11,21]]},"reference":[{"key":"rf3","first-page":"330","volume":"15","author":"Beth E. W.","journal-title":"Indagationes Math."},{"key":"rf7","volume-title":"Rough Sets\u2013Theoretical Aspects of Reasoning about Data","author":"Pawlak Z.","year":"1991"},{"key":"rf8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-7908-1840-6"},{"key":"rf9","series-title":"Methodology and Applications","volume-title":"Rough Sets in Knowledge Discovery","volume":"1","author":"Skoworn A.","year":"1998"},{"key":"rf10","series-title":"Applications, Case Studies and Software Systems","volume-title":"Rough Sets In Knowledge Discovery","volume":"2","author":"Skoworn A.","year":"1998"}],"container-title":["International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0218488511006861","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T17:25:28Z","timestamp":1565198728000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0218488511006861"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,2]]},"references-count":5,"journal-issue":{"issue":"01","published-online":{"date-parts":[[2011,11,21]]},"published-print":{"date-parts":[[2011,2]]}},"alternative-id":["10.1142\/S0218488511006861"],"URL":"https:\/\/doi.org\/10.1142\/s0218488511006861","relation":{},"ISSN":["0218-4885","1793-6411"],"issn-type":[{"value":"0218-4885","type":"print"},{"value":"1793-6411","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,2]]}}}