On Irreducible Descriptive Sets of Attributes for Information Systems

DOI10.1007/978-3-540-88425-5_3zbMath1185.68694OpenAlexW2750843466MaRDI QIDQ3541042

Andrzej Skowron, Zbigniew Suraj, Mikhail Ju. Moshkov

Publication date: 25 November 2008

Published in: Rough Sets and Current Trends in Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-88425-5_3

zbMATH Keywords

rough setsinformation systemsmaximal consistent extensionsirreducible descriptive sets

Mathematics Subject Classification ID

Knowledge representation (68T30) Reasoning under uncertainty in the context of artificial intelligence (68T37)

Related Items (1)

Rough Sets: From Rudiments to Challenges

Cites Work

• Rudiments of rough sets
• Inhibitory rules in data analysis. A rough set approach
• Maximal consistent extensions of information systems relative to their theories
• Information systems theoretical foundations
• Rough sets and concurrency
• On Testing Membership to Maximal Consistent Extensions of Information Systems
• Association Reducts: A Framework for Mining Multi-attribute Dependencies
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On Irreducible Descriptive Sets of Attributes for Information Systems