Abstract
The data structures dealt with in formal concept analysis are referred to as contexts. In this paper we study contexts within the framework of discrete duality. We show that contexts can be adequately represented by a class of sufficiency algebras called context algebras. On the logical side we define a class of context frames which are the semantic structures for context logic, a lattice-based logic associated with the class of context algebras. We prove a discrete duality between context algebras and context frames, and we develop a Hilbert style axiomatization of context logic and prove its completeness with respect to context frames. Then we prove a duality via truth theorem showing that both context algebras and context frames provide the adequate semantic structures for context logic. We discuss applications of context algebras and context logic to the specification and verification of various problems concerning contexts such as implications (attribute dependencies) in contexts, and derivation of implications from finite sets of implications.
Ewa Orłowska acknowledges partial support from the Polish Ministry of Science and Higher Education grant N N206 399134, and Ingrid Rewitzky acknowledges partial support from National Research Foundation of South Africa. Both authors acknowledge support from the Poland/SA Bilateral Collaboration Programme.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
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–216 (1993)
Armstrong, W.W.: Dependency structures of database relationships. Information Processing Letters 7, 580–583 (1974)
Buszkowski, W., Orłowska, E.: Indiscernibility based formalization of dependencies in information systems. In: Orłowska, E. (ed.) Incomplete Information: Rough Set Analysis, pp. 293–315. Physica-Verlag, Heidelberg (1997)
Davey, B.A., Priestley, H.A.: Introduction to Lattices and Order. Cambridge University Press, Cambridge (1990)
Demri, S.P., Orłowska, E.S.: Incomplete Information: Structure, Inference, Complexity. EATCS Monographs in Theoretical Computer Science. Springer, Heidelberg (2002)
Düntsch, I., Orłowska, E.: Beyond modalities: Sufficiency and mixed algebras. In: Orłowska, E., Szałas, A. (eds.) Relational Methods in Algebra, Logic, and Computer Science, pp. 277–299. Physica-Verlag, Heidelberg (2001)
Ganter, B., Wille, R.: Formal Concept Analysis: Mathematical Foundations. Springer, Heidelberg (1999)
Golińska-Pilarek, J., Orłowska, E.: Relational Reasoning in Formal Concept Analysis. In: Proceedings of the 2007 IEEE International Conference on Fuzzy Systems, London, pp. 1048–1053. IEEE Press, Los Alamitos (2007)
Järvinen, J.: Pawlak’s Information Systems in Terms of Galois Connections and Functional Dependencies. Fundamenta Informaticae 75, 315–330 (2007)
Jónson, B., Tarski, A.: Boolean algebras with operators, Part II. American Journal of Mathematics 74, 127–162 (1952)
MacCaul, W.: A tableaux for the implication problem for association rules. In: Orłowska, E., Szalas, A. (eds.) Relational Methods in Computer Science Applications, pp. 73–91. Springer-Physica Verlag, Heidelberg (2001)
Orłowska, E., Rewitzky, I., Düntsch, 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. 2939, pp. 17–32. Springer, Heidelberg (2006)
Orłowska, E., Rewitzky, I.: Duality via Truth: Semantic frameworks for lattice-based logics. Logic Journal of the IGPL 13(4), 467–490 (2005)
Orłowska, 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. 4585, pp. 51–56. Springer, Heidelberg (2007)
Orłowska, E., Rewitzky, I.: Algebras for Galois-style connections and their discrete duality. Fuzzy Sets and Systems (submitted, 2008)
Rasiowa, H., Sikorski, R.: The Mathematics of Metamathematics. Polish Scientific Publishers, Warsaw (1963)
Pawlak, Z.: Rough Sets - Theoretical Aspects of Reasoning about Data. Kluwer, Dordrecht (1991)
Priestley, H.A.: Representation of distributive lattices by means of ordered Stone spaces. Bulletin of the London Mathematical Society 2, 186–190 (1970)
Stone, M.H.: The theory of representations for Boolean algebras. Transactions of the American Mathematical Society 40, 37–111 (1936)
Von Karger, B.: Temporal algebra. Mathematical Structures in Computer Science 8, 277–320 (1995)
Wille, R.: Restructuring lattice theory: An approach based on hierarchies of concepts. In: Rival, I. (ed.) Ordered sets, NATO Advanced Studies Institute, vol. 83, pp. 445–470. Reidel, Dordrecht (1982)
Wille, R.: Boolean concept logic. In: Ganter, B., Mineau, G.W. (eds.) ICCS 2000. LNCS (LNAI), vol. 1867, pp. 317–331. Springer, Heidelberg (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Orłowska, E., Rewitzky, I. (2008). Context Algebras, Context Frames, and Their Discrete Duality. In: Peters, J.F., Skowron, A., Rybiński, H. (eds) Transactions on Rough Sets IX. Lecture Notes in Computer Science, vol 5390. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-89876-4_13
Download citation
DOI: https://doi.org/10.1007/978-3-540-89876-4_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-89875-7
Online ISBN: 978-3-540-89876-4
eBook Packages: Computer ScienceComputer Science (R0)