Skip to main content
Conference Proceedings

Constrained sums of information systems

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science) (2004) 3066 300-309
DOI: 10.1007/978-3-540-25929-9_35
14Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We study properties of infomorphisms between information systems. In particular, we interpret infomorphisms between information systems in terms of sums with constraints (constrained sums, for short) that are some operations on information systems. Applications of approximation spaces, used in rough set theory, to study properties of infomorphisms are included.

Cite

CITATION STYLE

APA

Skowron, A., & Stepaniuk, J. (2004). Constrained sums of information systems. In Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science) (Vol. 3066, pp. 300–309). Springer Verlag. https://doi.org/10.1007/978-3-540-25929-9_35

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free