  Decision trees and decision rule systems play important roles as classifiers,
knowledge representation tools, and algorithms. They are easily interpretable
models for data analysis, making them widely used and studied in computer
science. Understanding the relationships between these two models is an
important task in this field. There are well-known methods for converting
decision trees into systems of decision rules. In this paper, we consider the
inverse transformation problem, which is not so simple. Instead of constructing
an entire decision tree, our study focuses on a greedy polynomial time
algorithm that simulates the operation of a decision tree on a given tuple of
attribute values.
