@inbook{f3e43c2f1cb04876b27d41f8ae796388,

title = "Construction of all irreducible partial covers, all partial reducts and all irreducible partial decision rules",

abstract = "In this chapter, we study problems of construction of all irreducible partial covers, all partial reducts and all irreducible partial decision rules. We describe briefly the results obtained for irreducible partial covers. Let A be a set with n elements, S be a family of m subsets of A, and t be a natural number. We consider so-called t -covers for the set cover problem (A, S). A t -cover is a subfamily of S, subsets from which cover at least n - t elements from A. A t -cover is called irreducible if each proper subfamily of this t -cover is not a t -cover. We study the problem of construction of all irreducible t -covers for a given set cover problem.",

author = "Moshkov, {Mikhail Ju} and Marcin Piliszczuk and Beata Zielosko",

year = "2008",

doi = "10.1007/978-3-540-69029-0_4",

language = "English (US)",

isbn = "9783540690276",

series = "Studies in Computational Intelligence",

pages = "97--116",

editor = "Mikhail Moshkov and Beata Zielosko and Marcin Piliszczuk",

booktitle = "Partial Covers, Reducts and Decision Rules in Rough Sets",

}