Pawlak's Information Systems in Terms of Galois Connections and Functional Dependencies

Authors:
Jouni Järvinen
Affiliations:
Turku Centre for Computer Science (TUCS), University of Turku, 20014 Turku, Finland. E-mail: jouni.jarvinen@utu.fi
Venue:
Fundamenta Informaticae - New Frontiers in Scientific Discovery - Commemorating the Life and Work of Zdzislaw Pawlak
Year:
2007

Citing 4
Cited 7

A relational model of data for large shared data banks

Communications of the ACM
Rough Sets: Theoretical Aspects of Reasoning about Data

Rough Sets: Theoretical Aspects of Reasoning about Data
Formal Concept Analysis: Mathematical Foundations

Formal Concept Analysis: Mathematical Foundations
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness

Certain, Generalized Decision, and Membership Distribution Reducts Versus Functional Dependencies in Incomplete Systems

RSEISP '07 Proceedings of the international conference on Rough Sets and Intelligent Systems Paradigms
Context Algebras, Context Frames, and Their Discrete Duality

Transactions on Rough Sets IX
Concept Lattices of Subcontexts of a Context

Fundamenta Informaticae
Algebras for Galois-style connections and their discrete duality

Fuzzy Sets and Systems
Lattice theory for rough sets

Transactions on rough sets VI
A non-Boolean lattice derived by double indiscernibility

Transactions on rough sets XII
Concept Lattices of Subcontexts of a Context

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we show that each Galois connection between two complete lattices determines an Armstrong system, that is, a closed set of dependencies. Especially, we study Galois connections and Armstrong systems determined by Pawlak's information systems.