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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
Ā© 2008 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Moshkov, M.J., Piliszczuk, M., Zielosko, B. (2008). Construction of All Irreducible Partial Covers, All Partial Reducts and All Irreducible Partial Decision Rules. In: Partial Covers, Reducts and Decision Rules in Rough Sets. Studies in Computational Intelligence, vol 145. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69029-0_4
Download citation
DOI: https://doi.org/10.1007/978-3-540-69029-0_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-69027-6
Online ISBN: 978-3-540-69029-0
eBook Packages: EngineeringEngineering (R0)