{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T04:20:06Z","timestamp":1759033206422},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540160663"},{"type":"electronic","value":"9783540397489"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1985]]},"DOI":"10.1007\/3-540-16066-3_24","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T13:36:10Z","timestamp":1330176970000},"page":"288-297","source":"Crossref","is-referenced-by-count":22,"title":["Rough concepts logic"],"prefix":"10.1007","author":[{"given":"Helena","family":"Rasiowa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrzej","family":"Skowron","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,28]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Chen K.H., Ra\u015b Z., Skowron A., Attributes and rough properties in information systems, Proc. of the 1984 Conf. on Information Sciences and Systems, March 14\u201316, 1984, Princeton pp. 362\u2013366","key":"24_CR1","DOI":"10.1016\/0888-613X(88)90110-7"},{"unstructured":"Fagin R., Generalized first-order spectra and polynomial recognizable sets, \"Complexity of Computation,\" SIAM-AMS Proc. 7, 1974","key":"24_CR2"},{"doi-asserted-by":"crossref","unstructured":"Or\u0142owska E., Pawlak Z., Representation of nondeterministic information, Theoretical Computer Science 29, 1984","key":"24_CR3","DOI":"10.1016\/0304-3975(84)90010-0"},{"unstructured":"Pawlak Z., Rough relations, ICS PAS Reports 435 (1981)","key":"24_CR4"},{"issue":"5","key":"24_CR5","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1007\/BF01001956","volume":"11","author":"Z. Pawlak","year":"1982","unstructured":"Pawlak Z., Rough sets, International Journal of Information and Computer Science, 11 (5), 341\u2013356, 1982","journal-title":"International Journal of Information and Computer Science"},{"key":"24_CR6","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1016\/S0020-7373(84)80022-X","volume":"20","author":"Z. Pawlak","year":"1984","unstructured":"Pawlak Z., Rough classification, Int. J. Man-Machine Studies 20, 469\u2013483, 1984","journal-title":"Int. J. Man-Machine Studies"},{"unstructured":"Rasiowa H., Sikorski R., The mathematics of metamathematics, Warsaw PWN 1970","key":"24_CR7"},{"issue":"2","key":"24_CR8","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1137\/0208013","volume":"8","author":"L. Stockmeyer","year":"1979","unstructured":"Stockmeyer L., Chandra A.K., Provably difficult combinatorial games, SIAM Journal Comput., 8 (2), 151\u2013174, 1979","journal-title":"SIAM Journal Comput."}],"container-title":["Lecture Notes in Computer Science","Computation Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-16066-3_24.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T17:02:52Z","timestamp":1619542972000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-16066-3_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985]]},"ISBN":["9783540160663","9783540397489"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/3-540-16066-3_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1985]]}}}