Maximal consistent extensions of information systems relative to their theories

DOI10.1016/J.INS.2008.01.018zbMath1183.68609OpenAlexW2038248320MaRDI QIDQ1031680

Andrzej Skowron, Zbigniew Suraj, Mikhail Ju. Moshkov

Publication date: 30 October 2009

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2008.01.018

zbMATH Keywords

rough setsknowledge representationinformation systemsmaximal consistent extensions

Mathematics Subject Classification ID

Knowledge representation (68T30)

Related Items (5)

Contingency matrix theory: statistical dependence in a contingency table ⋮ Multi-stage optimization of decision and inhibitory trees for decision tables with many-valued decisions ⋮ On Irreducible Descriptive Sets of Attributes for Information Systems ⋮ Positive approximation and converse approximation in interval-valued fuzzy rough sets ⋮ The further investigation of covering-based rough sets: uncertainty characterization, similarity measure and generalized models

Uses Software

• ElemStatLearn

Cites Work

• Rough sets and Boolean reasoning
• Rough sets and concurrency
• On Testing Membership to Maximal Consistent Extensions of Information Systems
• Information Flow
• The elements of statistical learning. Data mining, inference, and prediction
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Maximal consistent extensions of information systems relative to their theories