Abstract
We give a simple representation of dependence spaces and a new characterization of the reducts of an arbitrary subset of a dependence space by the means of closure systems. We present an algorithm for finding the reducts of any given subset of a dependence space. The algorithm is based on a notion of difference function which connects the reduction problem to the general problem of identifying the set of all minimal vectors of values satisfying a positive (i.e., isotone) Boolean function.
Get full access to this article
View all access options for this article.