A Representation Of Dependence Spaces And Some Basic Algorithms

Authors:
Jouni Järvinen
Affiliations:
(Supported by Turku Centre for Computer Science TUCS/Graduate School) Department of Mathematics, University of Turku, FIN-20014 Turku, Finland, e-mail: jjarvine@utu.fi
Venue:
Fundamenta Informaticae
Year:
1997

Citing 4
Cited 0

Notes on the algebraic approach to dependence in information systems

Fundamenta Informaticae
On a problem concerning dependence spaces

Fundamenta Informaticae
On dependence in Wille's contexts

Fundamenta Informaticae
Complexity of identification and dualization of positive Boolean functions

Information and Computation

Quantified Score

Hi-index	0.00

Visualization

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.