Information theory applied to the conversion of decision tables to computer programs

Authors:
S. Ganapathy;V. Rajaraman
Affiliations:
Stanford Univ., Stanford, CA;Indian Institute of Technology
Venue:
Communications of the ACM
Year:
1973

Citing 6
Cited 13

Conversion of Limited-Entry Decision Tables to Optimal Computer Programs I: Minimum Average Processing Time

Journal of the ACM (JACM)
On the conversion of decision tables to computer programs

Communications of the ACM
Conversion of limited-entry decision tables to computer programs—a proposed modification to Pollack's algorithm

Communications of the ACM
Conversion of limited-entry decision tables to computer programs

Communications of the ACM
Conversion of decision tables to computer programs by rule mask techniques

Communications of the ACM
A procedure for converting logic table conditions into an efficient sequence of test instructions

Communications of the ACM

Criteria for Selecting a Variable in the Construction of Efficient Decision Trees

IEEE Transactions on Computers
Comments on 'Algorithmic State Machine Design and Automatic Theorem Proving: Dual Approaches to the Same Activity'

IEEE Transactions on Computers
Automatic discovery of contextual factors describing phonological variation

HLT '89 Proceedings of the workshop on Speech and Natural Language
Optimal Partitioning for Classification and Regression Trees

IEEE Transactions on Pattern Analysis and Machine Intelligence
Decision Trees and Diagrams

ACM Computing Surveys (CSUR)
The Activity of a Variable and Its Relation to Decision Trees

ACM Transactions on Programming Languages and Systems (TOPLAS)
Conversion of decision tables to efficient sequential testing procedures

Communications of the ACM
The synthetic approach to decision table conversion

Communications of the ACM
Extending the infomation theory approach to converting limited-entry decision tables to computer programs

Communications of the ACM
Sequential Decision Models for Expert System Optimization

IEEE Transactions on Knowledge and Data Engineering
Optimizing Boolean Expressions in Object-Bases

VLDB '92 Proceedings of the 18th International Conference on Very Large Data Bases
Application of Information Theory to Sequential Fault Diagnosis

IEEE Transactions on Computers
A heuristically 'optimal' knowledge base organization technique

Automatica (Journal of IFAC)

Quantified Score

Hi-index	48.28

Visualization

Abstract

Using ideas from information theory, this paper develops a heuristic algorithm that converts a limited entry decision table to a tree structured computer program with near minimum average processing time. The method is applicable to any limited entry decision table and does not require that actions have single rules or that the cost of testing conditions be equal. It is thus more general than the previously published heuristic algorithms. Compared to the optimal algorithm of Reinwald and Soland, this algorithm is easy to code and takes a much smaller translation time; it is thus felt that it is more useful in practice. The algorithm is well suited for manual conversion of decision tables to flowcharts.