Context Algebras, Context Frames, and Their Discrete Duality

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.

[1]  Bernhard Ganter,et al.  Formal Concept Analysis: Mathematical Foundations , 1998 .

[2]  Rudolf Wille,et al.  Restructuring Lattice Theory: An Approach Based on Hierarchies of Concepts , 2009, ICFCA.

[3]  Ewa Orlowska,et al.  Duality via Truth: Semantic frameworks for lattice-based logics , 2005, Log. J. IGPL.

[4]  A. Tarski,et al.  Boolean Algebras with Operators. Part I , 1951 .

[5]  J. Kacprzyk,et al.  Incomplete Information: Rough Set Analysis , 1997 .

[6]  A. Tarski,et al.  Boolean Algebras with Operators , 1952 .

[7]  Bernhard Ganter,et al.  Conceptual Structures: Logical, Linguistic, and Computational Issues , 2000, Lecture Notes in Computer Science.

[8]  Rudolf Wille,et al.  Boolean Concept Logic , 2000, ICCS.

[9]  Brian A. Davey,et al.  An Introduction to Lattices and Order , 1989 .

[10]  Ivo Düntsch,et al.  Beyond modalities: sufficiency and mixed algebras , 2001 .

[11]  R. Sikorski,et al.  The mathematics of metamathematics , 1963 .

[12]  Wendy MacCaull A tableaux procedure for the implication problem for association rules , 2001 .

[13]  M. Stone The theory of representations for Boolean algebras , 1936 .

[14]  Burghard von Karger Temporal algebra , 1998 .

[15]  Hilary A. Priestley,et al.  Representation of Distributive Lattices by means of ordered Stone Spaces , 1970 .

[16]  Joanna Golinska-Pilarek,et al.  Relational Reasoning in Formal Concept Analysis , 2007, 2007 IEEE International Fuzzy Systems Conference.

[17]  Wojciech Buszkowski,et al.  Indiscernibility-Based Formalization of Dependencies in Information Systems , 1998 .

[18]  Tomasz Imielinski,et al.  Mining association rules between sets of items in large databases , 1993, SIGMOD Conference.

[19]  Jouni Järvinen Pawlak's Information Systems in Terms of Galois Connections and Functional Dependencies , 2007, Fundam. Informaticae.

[20]  Ewa Orlowska,et al.  Discrete Duality and Its Applications to Reasoning with Incomplete Information , 2007, RSEISP.

[21]  Ivo Düntsch,et al.  Relational Semantics Through Duality , 2005, RelMiCS.

[22]  Stéphane Demri,et al.  Incomplete Information: Structure, Inference, Complexity , 2002, Monographs in Theoretical Computer Science An EATCS Series.

[23]  Z. Pawlak Rough Sets: Theoretical Aspects of Reasoning about Data , 1991 .