Preparation of the Book “Decision and Inhibitory Trees and Rules for Decision Tables with Many-Valued Decisions” (initiative project) OverviewGeneralization of results known for decision trees and rules over decision tables with many-valued decisions (bounds on complexity and greedy algorithms for construction) to the case of inhibitory trees and rules. Generalization of extensions of dynamic programming for decision trees and rules over decision tables with single-valued decisions to inhibitory trees and rules and to decision tables with many-valued decisions. Study of behavior of Shannon functions (describing relationships between complexity of problem description and complexity of problem solving) for decision and inhibitory trees and rule systems over decision tables with many-valued decisions. Details Generalization of results known for decision trees and rules over decision tables with many-valued decisions (bounds on complexity and greedy algorithms for construction) to the case of inhibitory trees and rules. Generalization of extensions of dynamic programming for decision trees and rules over decision tables with single-valued decisions to inhibitory trees and rules and to decision tables with many-valued decisions. Study of behavior of Shannon functions (describing relationships between complexity of problem description and complexity of problem solving) for decision and inhibitory trees and rule systems over decision tables with many-valued decisions.
