{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T07:21:55Z","timestamp":1725866515847},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319471594"},{"type":"electronic","value":"9783319471600"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-319-47160-0_12","type":"book-chapter","created":{"date-parts":[[2016,9,28]],"date-time":"2016-09-28T03:43:07Z","timestamp":1475034187000},"page":"131-142","source":"Crossref","is-referenced-by-count":0,"title":["Ordered Information Systems and Graph Granulation"],"prefix":"10.1007","author":[{"given":"John G.","family":"Stell","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,9,29]]},"reference":[{"key":"12_CR1","volume-title":"Hypergraphs: Combinatorics of Finite Sets","author":"C Berge","year":"1989","unstructured":"Berge, C.: Hypergraphs: Combinatorics of Finite Sets, vol. 45. North-Holland Mathematical Library, North-Holland (1989)"},{"key":"12_CR2","doi-asserted-by":"crossref","first-page":"857","DOI":"10.1007\/978-1-4020-5587-4_14","volume-title":"Handbook of Spatial Logics","author":"I Bloch","year":"2007","unstructured":"Bloch, I., Heijmans, H., Ronse, C.: Mathematical morphology. In: Aiello, M., Pratt-Hartmann, I., van Benthem, J. (eds.) Handbook of Spatial Logics, vol. 14, pp. 857\u2013944. Springer, Heidelberg (2007)"},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"Brown, R., Morris, I., Shrimpton, J., Wensley, C.D.: Graphs of morphisms of graphs. Elect. J. Comb. 15 (#A1). www.combinatorics.org\/ojs\/ (2008)","DOI":"10.37236\/919"},{"key":"12_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-04997-6","volume-title":"Incomplete Information: Structure, Inference, Complexity","author":"SP Demri","year":"2002","unstructured":"Demri, S.P., Or\u0142owska, E.S.: Incomplete Information: Structure, Inference, Complexity. Springer, Heidelberg (2002)"},{"key":"12_CR5","series-title":"Graduate Texts in Mathematics","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-14279-6","volume-title":"Graph Theory","author":"R Diestel","year":"2010","unstructured":"Diestel, R.: Graph Theory. Graduate Texts in Mathematics, vol. 173, 4th edn. Springer, Heidelberg (2010)","edition":"4"},{"key":"12_CR6","doi-asserted-by":"crossref","first-page":"230","DOI":"10.1016\/j.ins.2012.09.043","volume":"221","author":"T-F Fan","year":"2013","unstructured":"Fan, T.-F.: Rough set analysis of relational structures. Inf. Sci. 221, 230\u2013244 (2013)","journal-title":"Inf. Sci."},{"key":"12_CR7","first-page":"107","volume-title":"Rough Sets in Knowledge Discovery","author":"TY Lin","year":"1998","unstructured":"Lin, T.Y.: Granular computing on binary relations I, II. In: Polkowski, L., Skowron, A. (eds.) Rough Sets in Knowledge Discovery, pp. 107\u2013140. Physica, Heidelberg (1998)"},{"key":"12_CR8","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1007\/BF01001956","volume":"11","author":"Z Pawlak","year":"1982","unstructured":"Pawlak, Z.: Rough sets. Int. J. Comput. Inf. Sci. 11, 341\u2013356 (1982)","journal-title":"Int. J. Comput. Inf. Sci."},{"key":"12_CR9","series-title":"Advances in Soft Computing","volume-title":"Mathematical Foundations","author":"L Polkowski","year":"2002","unstructured":"Polkowski, L.: Rough Sets. Mathematical Foundations. Advances in Soft Computing. Physica, Heidelberg (2002)"},{"key":"12_CR10","volume-title":"Image Analysis and Mathematical Morphology","author":"J Serra","year":"1982","unstructured":"Serra, J.: Image Analysis and Mathematical Morphology. Academic Press, London (1982)"},{"key":"12_CR11","doi-asserted-by":"crossref","first-page":"245","DOI":"10.3233\/FI-1996-272311","volume":"27","author":"A Skowron","year":"1996","unstructured":"Skowron, A., Stepaniuk, J.: Tolerance approximation spaces. Fundamenta Informaticae 27, 245\u2013253 (1996)","journal-title":"Fundamenta Informaticae"},{"key":"12_CR12","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1109\/69.842271","volume":"12","author":"R Slowinski","year":"2000","unstructured":"Slowinski, R., Vanderpooten, D.: A generalized definition of rough approximations based on similarity. IEEE Trans. Knowl. Data Eng. 12, 331\u2013336 (2000)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"12_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"438","DOI":"10.1007\/978-3-540-74788-8_27","volume-title":"Spatial Information Theory","author":"JG Stell","year":"2007","unstructured":"Stell, J.G.: Relations in mathematical morphology with applications to graphs and rough sets. In: Winter, S., Duckham, M., Kulik, L., Kuipers, B. (eds.) COSIT 2007. LNCS, vol. 4736, pp. 438\u2013454. Springer, Heidelberg (2007)"},{"key":"12_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1007\/978-3-642-13529-3_29","volume-title":"Rough Sets and Current Trends in Computing","author":"JG Stell","year":"2010","unstructured":"Stell, J.G.: Relational granularity for hypergraphs. In: Szczuka, M., Kryszkiewicz, M., Ramanna, S., Jensen, R., Hu, Q. (eds.) RSCTC 2010. LNCS, vol. 6086, pp. 267\u2013276. Springer, Heidelberg (2010)"},{"key":"12_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1007\/978-3-642-33314-9_22","volume-title":"Relational and Algebraic Methods in Computer Science","author":"JG Stell","year":"2012","unstructured":"Stell, J.G.: Relations on hypergraphs. In: Kahl, W., Griffin, T.G. (eds.) RAMICS 2012. LNCS, vol. 7560, pp. 326\u2013341. Springer, Heidelberg (2012)"},{"key":"12_CR16","doi-asserted-by":"crossref","first-page":"440","DOI":"10.1016\/j.jlamp.2014.12.001","volume":"84","author":"JG Stell","year":"2015","unstructured":"Stell, J.G.: Symmetric Heyting relation algebras with applications to hypergraphs. J. Logical Algebraic Methods Program. 84, 440\u2013455 (2015)","journal-title":"J. Logical Algebraic Methods Program."},{"key":"12_CR17","doi-asserted-by":"crossref","first-page":"500","DOI":"10.1016\/j.jlamp.2015.11.003","volume":"85","author":"JG Stell","year":"2016","unstructured":"Stell, J.G., Schmidt, R.A., Rydeheard, D.: A bi-intuitionistic modal logic: foundations and automation. J. Logical Algebraic Methods Program. 85, 500\u2013519 (2016)","journal-title":"J. Logical Algebraic Methods Program."},{"key":"12_CR18","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/S0020-0255(98)10006-3","volume":"111","author":"YY Yao","year":"1998","unstructured":"Yao, Y.Y.: Relational interpretations of neighborhood operators and rough set approximation operators. Inf. Sci. 111, 239\u2013259 (1998)","journal-title":"Inf. Sci."}],"container-title":["Lecture Notes in Computer Science","Rough Sets"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-47160-0_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,26]],"date-time":"2020-09-26T08:39:59Z","timestamp":1601109599000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-47160-0_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319471594","9783319471600"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-47160-0_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}