On Testing Membership to Maximal Consistent Extensions of Information Systems

DOI10.1007/11908029_10MaRDI QIDQ3535438zbMATH OpenOpenAlexFDO

Authors Andrzej Skowron, Zbigniew Suraj, Mikhail Moshkov

Publication date 13 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/11908029_10

zbMATH Keywords

information systemsmaximal consistent extensionsrough sets

Mathematics Subject Classification ID

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

Recommendations

• Towards efficient computing consistent and partially consistent extensions of information systems
• Extensions of Information Systems: The Rough Set Perspective
• scientific article; zbMATH DE number 1927350
• Maximal consistent extensions of information systems relative to their theories
• Maximal consistent block technique for rule acquisition in incomplete information systems.

Cited in

(5)

• Maximal consistent extensions of information systems relative to their theories
• Extensions of Information Systems: The Rough Set Perspective
• On Irreducible Descriptive Sets of Attributes for Information Systems
• Rough Sets: From Rudiments to Challenges
• Towards efficient computing consistent and partially consistent extensions of information systems

This page was built for publication: On Testing Membership to Maximal Consistent Extensions of Information Systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3535438)