{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T12:06:50Z","timestamp":1759147610178},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540898757"},{"type":"electronic","value":"9783540898764"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"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":[[2008]]},"DOI":"10.1007\/978-3-540-89876-4_13","type":"book-chapter","created":{"date-parts":[[2008,12,17]],"date-time":"2008-12-17T09:23:57Z","timestamp":1229505837000},"page":"212-229","source":"Crossref","is-referenced-by-count":7,"title":["Context Algebras, Context Frames, and Their Discrete Duality"],"prefix":"10.1007","author":[{"given":"Ewa","family":"Or\u0142owska","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ingrid","family":"Rewitzky","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Imielinski, T., Swami, A.N.: Mining association rules between sets of items in large databases. In: Buneman, P., Jajodia, S. (eds.) Proceedings of the 1993 ACM SIGMOD International Conference on Managements of Data, pp. 207\u2013216 (1993)","DOI":"10.1145\/170035.170072"},{"key":"13_CR2","first-page":"580","volume":"7","author":"W.W. Armstrong","year":"1974","unstructured":"Armstrong, W.W.: Dependency structures of database relationships. Information Processing Letters\u00a07, 580\u2013583 (1974)","journal-title":"Information Processing Letters"},{"key":"13_CR3","first-page":"293","volume-title":"Incomplete Information: Rough Set Analysis","author":"W. Buszkowski","year":"1997","unstructured":"Buszkowski, W., Or\u0142owska, E.: Indiscernibility based formalization of dependencies in information systems. In: Or\u0142owska, E. (ed.) Incomplete Information: Rough Set Analysis, pp. 293\u2013315. Physica-Verlag, Heidelberg (1997)"},{"key":"13_CR4","volume-title":"Introduction to Lattices and Order","author":"B.A. Davey","year":"1990","unstructured":"Davey, B.A., Priestley, H.A.: Introduction to Lattices and Order. Cambridge University Press, Cambridge (1990)"},{"key":"13_CR5","series-title":"EATCS Monographs in Theoretical Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-04997-6","volume-title":"Incomplete Information: Structure, Inference, Complexity","author":"S.P. Demri","year":"2002","unstructured":"Demri, S.P., Or\u0142owska, E.S.: Incomplete Information: Structure, Inference, Complexity. EATCS Monographs in Theoretical Computer Science. Springer, Heidelberg (2002)"},{"key":"13_CR6","first-page":"277","volume-title":"Relational Methods in Algebra, Logic, and Computer Science","author":"I. D\u00fcntsch","year":"2001","unstructured":"D\u00fcntsch, I., Or\u0142owska, E.: Beyond modalities: Sufficiency and mixed algebras. In: Or\u0142owska, E., Sza\u0142as, A. (eds.) Relational Methods in Algebra, Logic, and Computer Science, pp. 277\u2013299. Physica-Verlag, Heidelberg (2001)"},{"key":"13_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-59830-2","volume-title":"Formal Concept Analysis: Mathematical Foundations","author":"B. Ganter","year":"1999","unstructured":"Ganter, B., Wille, R.: Formal Concept Analysis: Mathematical Foundations. Springer, Heidelberg (1999)"},{"key":"13_CR8","first-page":"1048","volume-title":"Proceedings of the 2007 IEEE International Conference on Fuzzy Systems","author":"J. Goli\u0144ska-Pilarek","year":"2007","unstructured":"Goli\u0144ska-Pilarek, J., Or\u0142owska, E.: Relational Reasoning in Formal Concept Analysis. In: Proceedings of the 2007 IEEE International Conference on Fuzzy Systems, London, pp. 1048\u20131053. IEEE Press, Los Alamitos (2007)"},{"key":"13_CR9","first-page":"315","volume":"75","author":"J. J\u00e4rvinen","year":"2007","unstructured":"J\u00e4rvinen, J.: Pawlak\u2019s Information Systems in Terms of Galois Connections and Functional Dependencies. Fundamenta Informaticae\u00a075, 315\u2013330 (2007)","journal-title":"Fundamenta Informaticae"},{"key":"13_CR10","doi-asserted-by":"publisher","first-page":"127","DOI":"10.2307\/2372074","volume":"74","author":"B. J\u00f3nson","year":"1952","unstructured":"J\u00f3nson, B., Tarski, A.: Boolean algebras with operators, Part II. American Journal of Mathematics\u00a074, 127\u2013162 (1952)","journal-title":"American Journal of Mathematics"},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"MacCaul, W.: A tableaux for the implication problem for association rules. In: Or\u0142owska, E., Szalas, A. (eds.) Relational Methods in Computer Science Applications, pp. 73\u201391. Springer-Physica Verlag, Heidelberg (2001)","DOI":"10.1007\/978-3-7908-1828-4_5"},{"key":"13_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1007\/11734673_2","volume-title":"Proceedings of the 8th International Conference on Relational Methods in Computer Science and 3rd International Conference on Applications of Kleene Algebras","author":"E. Or\u0142owska","year":"2006","unstructured":"Or\u0142owska, E., Rewitzky, I., D\u00fcntsch, I.: Relational semantics through duality. In: Proceedings of the 8th International Conference on Relational Methods in Computer Science and 3rd International Conference on Applications of Kleene Algebras. LNCS, vol.\u00a02939, pp. 17\u201332. Springer, Heidelberg (2006)"},{"issue":"4","key":"13_CR13","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1093\/jigpal\/jzi035","volume":"13","author":"E. Or\u0142owska","year":"2005","unstructured":"Or\u0142owska, E., Rewitzky, I.: Duality via Truth: Semantic frameworks for lattice-based logics. Logic Journal of the IGPL\u00a013(4), 467\u2013490 (2005)","journal-title":"Logic Journal of the IGPL"},{"key":"13_CR14","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/978-3-540-73451-2_7","volume-title":"Rough Sets and Intelligent Systems Paradigms","author":"E. Or\u0142owska","year":"2007","unstructured":"Or\u0142owska, E., Rewitzky, I.: Discrete duality and its application to reasoning with incomplete information. In: Kryszkiewicz, M., Peters, J.F., Rybinski, H., Skowron, A. (eds.) RSEISP 2007. LNCS (LNAI), vol.\u00a04585, pp. 51\u201356. Springer, Heidelberg (2007)"},{"key":"13_CR15","unstructured":"Or\u0142owska, E., Rewitzky, I.: Algebras for Galois-style connections and their discrete duality. Fuzzy Sets and Systems (submitted, 2008)"},{"key":"13_CR16","volume-title":"The Mathematics of Metamathematics","author":"H. Rasiowa","year":"1963","unstructured":"Rasiowa, H., Sikorski, R.: The Mathematics of Metamathematics. Polish Scientific Publishers, Warsaw (1963)"},{"key":"13_CR17","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, Dordrecht (1991)"},{"key":"13_CR18","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1112\/blms\/2.2.186","volume":"2","author":"H.A. Priestley","year":"1970","unstructured":"Priestley, H.A.: Representation of distributive lattices by means of ordered Stone spaces. Bulletin of the London Mathematical Society\u00a02, 186\u2013190 (1970)","journal-title":"Bulletin of the London Mathematical Society"},{"key":"13_CR19","first-page":"37","volume":"40","author":"M.H. Stone","year":"1936","unstructured":"Stone, M.H.: The theory of representations for Boolean algebras. Transactions of the American Mathematical Society\u00a040, 37\u2013111 (1936)","journal-title":"Transactions of the American Mathematical Society"},{"key":"13_CR20","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1017\/S0960129598002540","volume":"8","author":"B. Karger Von","year":"1995","unstructured":"Von Karger, B.: Temporal algebra. Mathematical Structures in Computer Science\u00a08, 277\u2013320 (1995)","journal-title":"Mathematical Structures in Computer Science"},{"key":"13_CR21","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, NATO Advanced Studies Institute, vol.\u00a083, pp. 445\u2013470. Reidel, Dordrecht (1982)"},{"key":"13_CR22","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/10722280_22","volume-title":"Conceptual Structures: Logical, Linguistic, and Computational Issues","author":"R. Wille","year":"2000","unstructured":"Wille, R.: Boolean concept logic. In: Ganter, B., Mineau, G.W. (eds.) ICCS 2000. LNCS (LNAI), vol.\u00a01867, pp. 317\u2013331. Springer, Heidelberg (2000)"}],"container-title":["Lecture Notes in Computer Science","Transactions on Rough Sets IX"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-89876-4_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,4]],"date-time":"2019-03-04T07:55:19Z","timestamp":1551686119000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-89876-4_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540898757","9783540898764"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-89876-4_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}