On covering attribute sets by reducts

Mikhail Moshkov*, Andrzej Skowron, Zbigniew Suraj

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

18 Scopus citations


For any fixed natural k, there exists a polynomial in time algorithm which for a given decision table T and given k conditional attributes recognizes if there exist a decision reduct of T containing these k attributes.

Original languageEnglish (US)
Title of host publicationRough Sets and Intelligent Systems Paradigms - International Conference, RSEISP 2007, Proceedings
PublisherSpringer Verlag
Number of pages6
ISBN (Print)9783540734505
StatePublished - 2007
Externally publishedYes
EventInternational Conference on Rough Sets and Intelligent Systems Paradigms, RSEISP 2007 - Warsaw, Poland
Duration: Jun 28 2007Jun 30 2007

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4585 LNAI
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


OtherInternational Conference on Rough Sets and Intelligent Systems Paradigms, RSEISP 2007


  • Decision reducts
  • Decision tables
  • Rough sets

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'On covering attribute sets by reducts'. Together they form a unique fingerprint.

Cite this