Main Reductions

Mikhail Moshkov*

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review


In this chapter, we consider some reductions which will be used later in the investigations of decision trees for problems. We show that, in the frameworks of the local approach, the study of decision trees for problems can be reduced to the study of decision trees for decision tables. We prove that, instead of arbitrary classes of information systems, we can consider classes containing only one information system. We also show that the matrix of upper local bounds for a sccf-triple completely defines its matrix of lower local bounds and vice versa. In particular, the local upper type of a sccf-triple completely defines its local lower type and vice versa.

Original languageEnglish (US)
Title of host publicationIntelligent Systems Reference Library
Number of pages11
StatePublished - 2020

Publication series

NameIntelligent Systems Reference Library
ISSN (Print)1868-4394
ISSN (Electronic)1868-4408

ASJC Scopus subject areas

  • General Computer Science
  • Information Systems and Management
  • Library and Information Sciences


Dive into the research topics of 'Main Reductions'. Together they form a unique fingerprint.

Cite this