{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T06:51:31Z","timestamp":1761807091530},"reference-count":7,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[2003,3,1]],"date-time":"2003-03-01T00:00:00Z","timestamp":1046476800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":3803,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[2003,3]]},"DOI":"10.1016\/s1571-0661(04)80718-7","type":"journal-article","created":{"date-parts":[[2004,9,29]],"date-time":"2004-09-29T16:47:47Z","timestamp":1096476467000},"page":"198-205","source":"Crossref","is-referenced-by-count":21,"title":["On the Decision Table with Maximal Number of Reducts"],"prefix":"10.1016","volume":"82","author":[{"given":"Hung Son","family":"Nguyen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(04)80718-7_NEWBIB1","series-title":"Rough Sets in Knowledge Discovery 1","first-page":"321","article-title":"A comparison of dynamic non-dynamic rough set methods for extracting laws from decision tables","author":"Bazan","year":"1998"},{"key":"10.1016\/S1571-0661(04)80718-7_NEWBIB2","unstructured":"Nguyen H. Son, Skowron A.: Boolean reasoning for feature extraction problems. In: Z.W. Ra\u015b and A. Skowron (Eds.): Proceedings of Tenth International Symposium on Foundation of Intelligent Systems, ISMIS'97, NC, USA, Foundation of Intelligent Systems LNAI 1325, Springer Verlag, 1997, pp. 117\u2013126."},{"key":"10.1016\/S1571-0661(04)80718-7_NEWBIB3","series-title":"Rough sets: Theoretical aspects of reasoning about data","author":"Pawlak","year":"1991"},{"key":"10.1016\/S1571-0661(04)80718-7_NEWBIB4","series-title":"Rough Sets in Knowledge Discovery vol. 1\u20132","year":"1998"},{"key":"10.1016\/S1571-0661(04)80718-7_NEWBIB5","series-title":"Intelligent Decision Support-Handbook of Applications and Advances of the Rough Sets Theory","first-page":"311","article-title":"The discernibility matrices and functions in information systems","author":"Skowron","year":"1992"},{"key":"10.1016\/S1571-0661(04)80718-7_NEWBIB6","series-title":"The complexity of boolean functions","author":"Wegener","year":"1987"},{"key":"10.1016\/S1571-0661(04)80718-7_NEWBIB7","series-title":"Proc. of RSCTC'98, Warsaw, Poland","first-page":"402","article-title":"Covering with reducts - a fast algorithm for rule generation","author":"Wr\u00f3blewski","year":"1998"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104807187?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104807187?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,3]],"date-time":"2019-02-03T10:53:34Z","timestamp":1549191214000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066104807187"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,3]]},"references-count":7,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2003,3]]}},"alternative-id":["S1571066104807187"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(04)80718-7","relation":{},"ISSN":["1571-0661"],"issn-type":[{"value":"1571-0661","type":"print"}],"subject":[],"published":{"date-parts":[[2003,3]]}}}