{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T08:13:22Z","timestamp":1760170402517},"publisher-location":"Berlin, Heidelberg","reference-count":37,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540711988"},{"type":"electronic","value":"9783540712008"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-71200-8_15","type":"book-chapter","created":{"date-parts":[[2007,5,21]],"date-time":"2007-05-21T09:30:21Z","timestamp":1179739821000},"page":"253-297","source":"Crossref","is-referenced-by-count":7,"title":["Formal Topology and Information Systems"],"prefix":"10.1007","author":[{"given":"Piero","family":"Pagliani","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mihir K.","family":"Chakraborty","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"15_CR1","doi-asserted-by":"crossref","first-page":"211","DOI":"10.3233\/FI-1996-283401","volume":"28","author":"M. Banerjee","year":"1996","unstructured":"Banerjee, M., Chakraborty, M.: Rough Sets Through Algebraic Logic. Fundamenta Informaticae\u00a028, 211\u2013221 (1996)","journal-title":"Fundamenta Informaticae"},{"key":"15_CR2","doi-asserted-by":"crossref","unstructured":"Banerjee, M., Chakraborty, M.K.: Foundations of Vagueness: a Category-theoretic Approach. Electronic Notes in Theoretical Comp. Sc.\u00a082(4) (2003)","DOI":"10.1016\/S1571-0661(04)80701-1"},{"key":"15_CR3","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511895968","volume-title":"Information Flow: the Logic of Distributed Systems","author":"J. Barwise","year":"1997","unstructured":"Barwise, J., Seligman, J.: Information Flow: the Logic of Distributed Systems. Cambridge University Press, Cambridge (1997)"},{"key":"15_CR4","first-page":"13","volume-title":"Proc. Southeast Asian Conf. on Logic","author":"J.L. Bell","year":"1983","unstructured":"Bell, J.L.: Orthologic, Forcing, and the Manifestation of Attributes. In: Chong, C.T., Wicks, M.J. (eds.) Proc. Southeast Asian Conf. on Logic, pp. 13\u201336. North-Holland, Amsterdam (1983)"},{"key":"15_CR5","volume-title":"Residuation Theory","author":"T.S. Blyth","year":"1972","unstructured":"Blyth, T.S., Janowitz, M.F.: Residuation Theory. Pergamon Press, Oxford (1972)"},{"key":"15_CR6","series-title":"Lecture Notes in Artificial Intelligence","volume-title":"Rough Sets and Current Trends in Computing","author":"M.K. Chakraborty","year":"2004","unstructured":"Chakraborty, M.K., Banerjee, M.: Dialogue in Rough Context. In: Tsumoto, S., et al. (eds.) RSCTC 2004. LNCS (LNAI), vol.\u00a03066, Springer, Heidelberg (2004)"},{"key":"15_CR7","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1109\/ICDM.2002.1183898","volume-title":"Proc. of the 2002 IEEE Int. Conf. on Data Mining","author":"I. D\u00fcntsch","year":"2002","unstructured":"D\u00fcntsch, I., Gegida, G.: Modal-style operators in qualitative data analysis. In: Proc. of the 2002 IEEE Int. Conf. on Data Mining, pp. 155\u2013162. IEEE Computer Society Press, Los Alamitos (2002)"},{"key":"15_CR8","first-page":"99","volume":"28","author":"I. D\u00fcntsch","year":"1999","unstructured":"D\u00fcntsch, I., Or\u0142owska, E.: Mixing modal and sufficiency operators. Bulletin of the Section of Logic, Polish Academy of Sciences\u00a028, 99\u2013106 (1999)","journal-title":"Bulletin of the Section of Logic, Polish Academy of Sciences"},{"key":"15_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-67678-9","volume-title":"A compendium of Continuous Lattices","author":"G. Gierz","year":"1980","unstructured":"Gierz, G., et al.: A compendium of Continuous Lattices. Springer, Heidelberg (1980)"},{"issue":"3","key":"15_CR10","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1305\/ndjfl\/1093870378","volume":"24","author":"I.L. Humberstone","year":"1983","unstructured":"Humberstone, I.L.: Inaccessible worlds. Notre Dame Journal of Formal Logic\u00a024(3), 346\u2013352 (1983)","journal-title":"Notre Dame Journal of Formal Logic"},{"key":"15_CR11","first-page":"107","volume-title":"Rough Sets in Knowledge Discovery. 1: Methodology and Applications","author":"T.Y. Lin","year":"1998","unstructured":"Lin, T.Y.: Granular Computing on Binary Relations. I: Data Mining and Neighborhood Systems. II: Rough Set Representation and Belief. In: Polkowski, L., Skowron, A. (eds.) Rough Sets in Knowledge Discovery. 1: Methodology and Applications, pp. 107\u2013121 and pp. 122\u2013140. Physica-Verlag, Heidelberg (1998)"},{"key":"15_CR12","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1007\/BF00370813","volume":"44","author":"E. Or\u0142owska","year":"1985","unstructured":"Or\u0142owska, E.: Logic for nondeterministic information. Studia Logica\u00a044, 93\u2013102 (1985)","journal-title":"Studia Logica"},{"issue":"1","key":"15_CR13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.3233\/FI-1993-18102","volume":"18","author":"P. Pagliani","year":"1993","unstructured":"Pagliani, P.: From Concept Lattices to Approximation spaces: Algebraic Structures of some Spaces of Partial Objects. Fund. Informaticae\u00a018(1), 1\u201325 (1993)","journal-title":"Fund. Informaticae"},{"key":"15_CR14","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1007\/978-1-4471-3238-7_27","volume-title":"Rough Sets, Fuzzy Sets and Knowledge Discovery, Proc. of the Int. Workshop on Rough Sets and Knowledge Discovery","author":"P. Pagliani","year":"1994","unstructured":"Pagliani, P.: A pure logic-algebraic analysis on rough top and rough bottom equalities. In: Ziarko, W.P. (ed.) Rough Sets, Fuzzy Sets and Knowledge Discovery, Proc. of the Int. Workshop on Rough Sets and Knowledge Discovery, Banff, October 1993, pp. 227\u2013236. Springer, Heidelberg (1994)"},{"key":"15_CR15","first-page":"109","volume-title":"Incomplete Information: Rough Set Analysis","author":"P. Pagliani","year":"1997","unstructured":"Pagliani, P.: Rough Set Systems and Logic-algebraic Structures. In: Orlowska, E. (ed.) Incomplete Information: Rough Set Analysis, pp. 109\u2013190. Physica Verlag, Heidelberg (1997)"},{"key":"15_CR16","unstructured":"Pagliani, P.: Modalizing Relations by means of Relations: a general framework for two basic approaches to Knowledge Discovery in Database. In: Proc. of the International Conference on Information Processing and Management of Uncertainty in Knowledge-Based Systems, IPMU 98, \u201dLa Sorbonne\u201d, Paris, France, July, 6-10, 1998, pp. 1175\u20131182 (1998)"},{"key":"15_CR17","first-page":"209","volume-title":"Rough Sets in Knowledge Discovery","author":"P. Pagliani","year":"1998","unstructured":"Pagliani, P.: A practical introduction to the modal relational approach to Approximation Spaces. In: Skowron, A. (ed.) Rough Sets in Knowledge Discovery, pp. 209\u2013232. Physica-Verlag, Heidelberg (1998)"},{"key":"15_CR18","unstructured":"Pagliani, P.: Concrete neighbourhood systems and formal pretopological spaces (draft). In: Conference held at the Calcutta Logical Circle Conference on Logic and Artificial Intelligence, Calcutta, October 13-16 (2003)"},{"key":"15_CR19","unstructured":"Pagliani, P.: Pretopology and Dynamic Spaces. In: Proc. of RSFSGRC\u201903, Chongqing, R.P. China (2003), Extended version in Fundamenta Informaticae 59(2-3), 221\u2013239 (2004)"},{"key":"15_CR20","doi-asserted-by":"crossref","unstructured":"Pagliani, P.: Transforming Information Systems. In: Proc. of RSFDGrC 2005, vol. 1, pp. 660\u2013670 (2005)","DOI":"10.1007\/11548669_68"},{"key":"15_CR21","doi-asserted-by":"publisher","first-page":"605","DOI":"10.1109\/GRC.2005.1547363","volume-title":"Proc. of the IEEE Int. Conf. on Granular Computing","author":"P. Pagliani","year":"2005","unstructured":"Pagliani, P., Chakraborty, M.K.: Information Quanta and Approximation Spaces. I: Non-classical approximation operators. In: Proc. of the IEEE Int. Conf. on Granular Computing, Beijing, R.P. China, pp. 605\u2013610. IEEE Computer Society Press, Los Alamitos (2005)"},{"key":"15_CR22","doi-asserted-by":"publisher","first-page":"611","DOI":"10.1109\/GRC.2005.1547364","volume-title":"Proc. of the IEEE Int. Conf. on Granular Computing","author":"P. Pagliani","year":"2005","unstructured":"Pagliani, P., Chakraborty, M.K.: Information Quanta and Approximation Spaces. II: Generalised approximation operators. In: Proc. of the IEEE Int. Conf. on Granular Computing, Beijing, R.P. China, pp. 611\u2013616. IEEE Computer Society Press, Los Alamitos (2005)"},{"key":"15_CR23","doi-asserted-by":"crossref","DOI":"10.1007\/978-94-011-3534-4","volume-title":"Rough Sets: A Theoretical Approach to Reasoning about Data","author":"Z. Pawlak","year":"1991","unstructured":"Pawlak, Z.: Rough Sets: A Theoretical Approach to Reasoning about Data. Kluwer Academic Publishers, Dordrecht (1991)"},{"key":"15_CR24","series-title":"Advances in Soft Computing","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-7908-1776-8","volume-title":"Rough Sets: Mathematical Foundations","author":"L. Polkowski","year":"2002","unstructured":"Polkowski, L.: Rough Sets: Mathematical Foundations. Advances in Soft Computing. Physica-Verlag, Heidelberg (2002)"},{"key":"15_CR25","first-page":"261","volume-title":"Logic Colloquium \u201988","author":"G. Sambin","year":"1989","unstructured":"Sambin, G.: Intuitionistic formal spaces and their neighbourhood. In: Ferro, R., et al. (eds.) Logic Colloquium \u201988, pp. 261\u2013285. Elsevier, Amsterdam (1989)"},{"key":"15_CR26","doi-asserted-by":"crossref","unstructured":"Sambin, G., Gebellato, S.: A Preview of the Basic Picture: A New Perspective on Formal Topology. In: TYPES 1998, pp. 194\u2013207 (1998)","DOI":"10.1007\/3-540-48167-2_14"},{"key":"15_CR27","unstructured":"Sambin, G.: Formal topology and domains. In: Proc. of the Workshop on Domains, IV. Informatik-Bericht, Nr. 99-01, Universit\u00e4t GH Siegen (1999)"},{"key":"15_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"662","DOI":"10.1007\/BFb0036946","volume-title":"Automata, Languages and Programming","author":"M. Smyth","year":"1983","unstructured":"Smyth, M.: Powerdomains and predicate transformers: a topological view. In: D\u00edaz, J. (ed.) Automata, Languages and Programming. LNCS, vol.\u00a0154, pp. 662\u2013675. Springer, Heidelberg (1983)"},{"issue":"2-3","key":"15_CR29","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\u00a027(2-3), 245\u2013253 (1996)","journal-title":"Fundamenta Informaticae"},{"key":"15_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1007\/11427834_8","volume-title":"Transactions on Rough Sets III","author":"A. Skowron","year":"2005","unstructured":"Skowron, A., Swiniarski, R., Synak, P.: Approximation Spaces and Information Granulation. In: Peters, J.F., Skowron, A. (eds.) Transactions on Rough Sets III. LNCS, vol.\u00a03400, pp. 175\u2013189. Springer, Heidelberg (2005)"},{"issue":"1-3","key":"15_CR31","first-page":"363","volume":"72","author":"A. Skowron","year":"2006","unstructured":"Skowron, A., et al.: Calculi of approximation spaces. Fundamenta Informaticae\u00a072(1-3), 363\u2013378 (2006)","journal-title":"Fundamenta Informaticae"},{"key":"15_CR32","first-page":"492","volume-title":"Incomplete Information - Rough Set Analysis","author":"D. Vakarelov","year":"1997","unstructured":"Vakarelov, D.: Information systems, similarity relations and modal logics. In: Orlowska, E. (ed.) Incomplete Information - Rough Set Analysis, pp. 492\u2013550. Physica-Verlag, Heidelberg (1997)"},{"key":"15_CR33","volume-title":"Topology via Logic","author":"S. Vickers","year":"1989","unstructured":"Vickers, S.: Topology via Logic. Cambridge University Press, Cambridge (1989)"},{"key":"15_CR34","series-title":"NATO ASI Series","doi-asserted-by":"crossref","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. In: Rival, I. (ed.) Ordered Sets. NATO ASI Series, vol.\u00a083, pp. 445\u2013470. Reidel, Dordrecht (1982)"},{"key":"15_CR35","volume-title":"Advances in Soft Computing: Engineering Design and Manufacturing","author":"Y.Y. Yao","year":"1999","unstructured":"Yao, Y.Y.: Granular computing using neighborhood systems. In: Roy, R., Fumhashi, T., Chawdhry, P.K. (eds.) Advances in Soft Computing: Engineering Design and Manufacturing, Springer, London (1999)"},{"key":"15_CR36","doi-asserted-by":"crossref","unstructured":"Yao, Y.Y.: A comparative study of formal concept analysis and rough set theory in data analysis. Manuscript (2004)","DOI":"10.1007\/978-3-540-25929-9_6"},{"key":"15_CR37","doi-asserted-by":"crossref","unstructured":"Zhang, G.-Q.: Chu spaces, concept lattices and domains. In: Proc. of the 19 th Conf. on the Mathematical Found. of Programming Semantics, March 2003. Electronic Notes in Theor. Comp. Sc., vol.\u00a083 (2004)","DOI":"10.1016\/S1571-0661(03)50016-0"}],"container-title":["Lecture Notes in Computer Science","Transactions on Rough Sets VI"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-71200-8_15.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,13]],"date-time":"2021-08-13T20:53:30Z","timestamp":1628888010000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-71200-8_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540711988","9783540712008"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-71200-8_15","relation":{},"subject":[]}}