Discrete duality and its applications to reasoning with incomplete information

Simple item page
dc.contributor.authorOrlowska E.
dc.contributor.authorRewitzky I.
dc.date.accessioned2011-05-15T16:02:06Z
dc.date.available2011-05-15T16:02:06Z
dc.date.issued2007
dc.description.abstractWe 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.
dc.description.versionConference Paper
dc.identifier.citationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
dc.identifier.citation4585 LNAI
dc.identifier.issn3029743
dc.identifier.urihttp://hdl.handle.net/10019.1/12307
dc.subjectAlgebra
dc.subjectData reduction
dc.subjectInformation systems
dc.subjectRough set theory
dc.subjectTopology
dc.subjectCorrespondence theory
dc.subjectDiscrete duality
dc.subjectIncomplete information
dc.subjectLogical systems
dc.subjectCase based reasoning
dc.titleDiscrete duality and its applications to reasoning with incomplete information
dc.typeConference Paper
Files
Collections
Stellenbosch University - Scopus Publications