{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:45:40Z","timestamp":1725551140229},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540294986"},{"type":"electronic","value":"9783540322450"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11571155_4","type":"book-chapter","created":{"date-parts":[[2005,10,31]],"date-time":"2005-10-31T07:32:31Z","timestamp":1130743951000},"page":"38-44","source":"Crossref","is-referenced-by-count":0,"title":["On Construction of the Set of Irreducible Partial Covers"],"prefix":"10.1007","author":[{"given":"Mikhail Ju.","family":"Moshkov","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"4_CR1","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1137\/S0097539793269089","volume":"26","author":"E. Boros","year":"1997","unstructured":"Boros, E., Hammer, P.L., Ibaraki, T., Kawakami, K.: Polynomial time recognition of 2-monotonic positive Boolean functions given by an oracle. SIAM J. Computing\u00a026(1), 93\u2013109 (1997)","journal-title":"SIAM J. Computing"},{"key":"4_CR2","unstructured":"Chegis, I.A., Yablonskii, S.V.: Logical methods of electric circuit control. Trudy MIAN SSSR\u00a051, 270\u2013360 (1958) (in Russian)"},{"key":"4_CR3","first-page":"5","volume":"38","author":"A.D. Korshunov","year":"1981","unstructured":"Korshunov, A.D.: On the number of monotone Boolean functions. Problemy Kibernetiki\u00a038, 5\u2013108 (1981) (in Russian)","journal-title":"Problemy Kibernetiki"},{"issue":"5","key":"4_CR4","doi-asserted-by":"publisher","first-page":"1363","DOI":"10.1137\/S0097539794276324","volume":"26","author":"K. Makino","year":"1997","unstructured":"Makino, K., Ibaraki, T.: The maximum latency and identification of positive Boolean functions. SIAM J. Computing\u00a026(5), 1363\u20131383 (1997)","journal-title":"SIAM J. Computing"},{"key":"4_CR5","volume-title":"Rough Sets \u2013 Theoretical Aspects of Reasoning about Data","author":"Z. Pawlak","year":"1991","unstructured":"Pawlak, Z.: Rough Sets \u2013 Theoretical Aspects of Reasoning about Data. Kluwer Academic Publishers, Dordrecht (1991)"},{"key":"4_CR6","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/S0020-0190(00)00225-8","volume":"79","author":"I. Shmulevich","year":"2001","unstructured":"Shmulevich, I., Korshunov, A.D., Astola, J.: Almost all monotone Boolean functions are polynomially lernable using membership queries. Information Processing Letters\u00a079, 211\u2013213 (2001)","journal-title":"Information Processing Letters"},{"key":"4_CR7","unstructured":"Skowron, A.: Rough sets in KDD. In: Proceedings of the 16-th World Computer Congress (IFIP 2000). Beijing, China, pp. 1\u201314 (2000)"}],"container-title":["Lecture Notes in Computer Science","Stochastic Algorithms: Foundations and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11571155_4.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:40:34Z","timestamp":1619505634000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11571155_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540294986","9783540322450"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/11571155_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}