Discrete duality and its applications to reasoning with incomplete information
Date
2007
Authors
Orlowska E.
Rewitzky I.
Journal Title
Journal ISSN
Volume Title
Publisher
Abstract
We present general principles of establishing a duality between a class of algebras and a class of relational systems such that topology is not involved. We show how such a discrete duality contributes to proving completeness of logical systems and to correspondence theory. Next, we outline applications of discrete dualities to analysis of data in information systems with incomplete information in the rough set-style, and in contexts of formal concept analysis. © Springer-Verlag Berlin Heidelberg 2007.
Description
Keywords
Algebra, Data reduction, Information systems, Rough set theory, Topology, Correspondence theory, Discrete duality, Incomplete information, Logical systems, Case based reasoning
Citation
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
4585 LNAI
4585 LNAI