KAUST DepartmentApplied Mathematics and Computational Science Program
Computer Science Program
Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
Online Publication Date2017-11-22
Print Publication Date2018-02
Permanent link to this recordhttp://hdl.handle.net/10754/626257
MetadataShow full item record
AbstractOptimality of decision rules (patterns) can be measured in many ways. One of these is referred to as length. Length signifies the number of terms in a decision rule and is optimally minimized. Another, coverage represents the width of a rule’s applicability and generality. As such, it is desirable to maximize coverage. A totally optimal decision rule is a decision rule that has the minimum possible length and the maximum possible coverage. This paper presents a method for determining the presence of totally optimal decision rules for “complete” decision tables (representations of total functions in which different variables can have domains of differing values). Depending on the cardinalities of the domains, we can either guarantee for each tuple of values of the function that totally optimal rules exist for each row of the table (as in the case of total Boolean functions where the cardinalities are equal to 2) or, for each row, we can find a tuple of values of the function for which totally optimal rules do not exist for this row.
CitationAmin T, Moshkov M (2017) Totally optimal decision rules. Discrete Applied Mathematics. Available: http://dx.doi.org/10.1016/j.dam.2017.10.024.
SponsorsResearch reported in this publication was supported by King Abdullah University of Science and Technology (KAUST) . The authors are grateful to the anonymous reviewer for useful comments and suggestions.
JournalDiscrete Applied Mathematics