Context algebras, context frames, and their discrete duality
Date
2008
Authors
Orlowska E.
Rewitzky I.
Journal Title
Journal ISSN
Volume Title
Publisher
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. © 2008 Springer Berlin Heidelberg.
Description
Keywords
Data structures, Formal logic, Information theory, Semantics, Set theory, Attribute dependency, Concept, Context, Duality, Duality via truth, Formal concept analysis, Implication, Representation theorem, Algebra
Citation
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
5390 LNCS
5390 LNCS