A Formal Context for Symmetric Dependencies
Lecture Notes on Artificial Intelligence
Armstrong and symmetric dependencies are
two of the main groups of dependencies
in the relational database model,
both of them having their own set of axioms.
The closure of a set of dependencies is the largest set
of dependencies that can be calculated by the recursive application
of those axioms.
There are two problems related to a closure:
its calculation and its characterization.
Formal concept analysis has dealt with those problems
in the case of Armstrong dependencies
(that is, functional dependencies and alike).
In this paper, we present a formal context for symmetric
dependencies that calculates
the closure and the lattice characterization
of a set of symmetric dependencies.