{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:34:01Z","timestamp":1725536041103},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642032806"},{"type":"electronic","value":"9783642032813"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-03281-3_1","type":"book-chapter","created":{"date-parts":[[2009,7,23]],"date-time":"2009-07-23T07:19:56Z","timestamp":1248333596000},"page":"1-14","source":"Crossref","is-referenced-by-count":0,"title":["Rough Set Theory: Ontological Systems, Entailment Relations and Approximation Operators"],"prefix":"10.1007","author":[{"given":"Marcin","family":"Wolski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"Cederquist, J., Coquand, T.: Entailment relations and distributive lattices. In: Buss, S., H\u00e0jek, P., Pudl\u00e0k, P. (eds.) Logic Colloquium 1998. Lecture Notes in Logic, vol.\u00a013, pp. 127\u2013139. Association for Symbolic Logic (1999)","DOI":"10.1017\/9781316756140.011"},{"issue":"1","key":"1_CR2","doi-asserted-by":"crossref","first-page":"43","DOI":"10.3233\/FI-1998-33103","volume":"33","author":"G. Dimov","year":"1998","unstructured":"Dimov, G., Vakarelov, D.: On Scott Consequence Systems. Fundamenta Informaticae (FUIN)\u00a033(1), 43\u201370 (1998)","journal-title":"Fundamenta Informaticae (FUIN)"},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"Ern\u00e9, M., Klossowski, E., Melton, A., Strecker, G.E.: A primer on Galois connections. In: Proceedings of the 1991 Summer Conference on General Topology and Applications in Honour of Mary Elen Rudin and Her Work. Annals of the New York Academy of Sciences, vol.\u00a0704, pp. 103\u2013125 (1993)","DOI":"10.1111\/j.1749-6632.1993.tb52513.x"},{"key":"1_CR4","first-page":"605","volume-title":"Proceedings of the IEEE International Conference on Granular Computing","author":"P. Pagliani","year":"2005","unstructured":"Pagliani, P., Chakraborty, M.: Information quanta and approximation spaces. I: Non-classical approximation operators. In: Hu, X., Liu, Q., Skowron, A., Lin, T.S., Yager, R.R., Zhang, E.B. (eds.) Proceedings of the IEEE International Conference on Granular Computing, vol.\u00a02, pp. 605\u2013610. IEEE, Los Alamitos (2005)"},{"key":"1_CR5","first-page":"611","volume-title":"Proceedings of the IEEE International Conference on Granular Computing","author":"P. Pagliani","year":"2005","unstructured":"Pagliani, P., Chakraborty, M.: Information quanta and approximation spaces. II: Generalised approximation space. In: Hu, X., Liu, Q., Skowron, A., Lin, T.S., Yager, R.R., Zhang, E.B. (eds.) Proceedings of the IEEE International Conference on Granular Computing, vol.\u00a02, pp. 611\u2013616. IEEE, Los Alamitos (2005)"},{"key":"1_CR6","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/BF01001956","volume":"11","author":"Z. Pawlak","year":"1982","unstructured":"Pawlak, Z.: Rough sets. Int. J. Computer and Information Sci.\u00a011, 341\u2013356 (1982)","journal-title":"Int. J. Computer and Information Sci."},{"key":"1_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-011-3534-4","volume-title":"Rough Sets: Theoretical Aspects of Reasoning about Data","author":"Z. Pawlak","year":"1991","unstructured":"Pawlak, Z.: Rough Sets: Theoretical Aspects of Reasoning about Data. Kluwer Academic Publisher, Dordrecht (1991)"},{"key":"1_CR8","unstructured":"Rasiowa, H.: Algebraic Models of Logics. University of Warsaw (2001)"},{"key":"1_CR9","doi-asserted-by":"crossref","unstructured":"Scott, D.: Completeness and axiomatizability. In: Proceedings of the Tarski Symposium, pp. 411\u2013435 (1974)","DOI":"10.1090\/pspum\/025\/0363802"},{"key":"1_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1007\/BFb0012801","volume-title":"Automata, Languages, and Programming","author":"D. Scott","year":"1982","unstructured":"Scott, D.: Domains for Denotational Semantics. In: Nielsen, M., Schmidt, E.M. (eds.) ICALP 1982. LNCS, vol.\u00a0140, pp. 577\u2013613. Springer, Heidelberg (1982)"},{"key":"1_CR11","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1007\/978-94-015-7975-9_24","volume-title":"Intelligent Decision Support, Handbook of Applications and Advances in Rough Sets Theory","author":"D. Vakarelov","year":"1992","unstructured":"Vakarelov, D.: Consequence relations and Information Systems. In: S\u0142owi\u0144ski, R. (ed.) Intelligent Decision Support, Handbook of Applications and Advances in Rough Sets Theory, pp. 391\u2013400. Kluwer Academic Publishers, Dordrecht (1992)"},{"issue":"1","key":"1_CR12","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/BF01053038","volume":"55","author":"D. Vakarelov","year":"1995","unstructured":"Vakarelov, D.: A duality between Pawlak\u2019s knowledge representation systems and BI-consequence systems. Studia Logica\u00a055(1), 205\u2013228 (1995)","journal-title":"Studia Logica"},{"key":"1_CR13","doi-asserted-by":"publisher","first-page":"492","DOI":"10.1007\/978-3-7908-1888-8_16","volume-title":"Incomplete Information: Rough Set Analysis","author":"D. Vakarelov","year":"1998","unstructured":"Vakarelov, D.: Information systems, similarity and modal logics. In: Or\u0142owska, E. (ed.) Incomplete Information: Rough Set Analysis, pp. 492\u2013550. Physica-Verlag, Heidelberg (1998)"},{"key":"1_CR14","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1007\/978-94-009-7798-3_15","volume-title":"Ordered Sets","author":"R. Wille","year":"1982","unstructured":"Wille, R.: Restructuring lattice theory: an approach based on hierarchies of concepts. In: Rival, I. (ed.) Ordered Sets, pp. 445\u2013470. Reidel, Dordrecht (1982)"},{"key":"1_CR15","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1016\/0898-1221(92)90120-7","volume":"23","author":"R. Wille","year":"1992","unstructured":"Wille, R.: Concept lattices and conceptual knowledge systems. Computers & Mathematics with Applications\u00a023, 493\u2013515 (1992)","journal-title":"Computers & Mathematics with Applications"},{"key":"1_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/978-3-540-85064-9_11","volume-title":"Transactions on Rough Sets VIII","author":"M. Wolski","year":"2008","unstructured":"Wolski, M.: Information quanta and approximation operators: once more around the track. In: Peters, J.F., Skowron, A. (eds.) Transactions on Rough Sets VIII. LNCS, vol.\u00a05084, pp. 237\u2013250. Springer, Heidelberg (2008)"}],"container-title":["Lecture Notes in Computer Science","Transactions on Rough Sets X"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03281-3_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,20]],"date-time":"2020-05-20T22:38:11Z","timestamp":1590014291000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03281-3_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642032806","9783642032813"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03281-3_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}