Simplification of a Class of Boolean Functions
Journal of the ACM (JACM)
An Efficient Algorithm for Finding Certain Minimum-Cost Procedures for Making Binary Decisions
Journal of the ACM (JACM)
Use of decision tables in computer programming
Communications of the ACM
Conversion of decision tables to computer programs
Communications of the ACM
Conversion of limited-entry decision tables to computer programs
Communications of the ACM
A procedure for converting logic table conditions into an efficient sequence of test instructions
Communications of the ACM
Communications of the ACM
Criteria for Selecting a Variable in the Construction of Efficient Decision Trees
IEEE Transactions on Computers
Journal of the ACM (JACM)
Translation of Decision Tables
ACM Computing Surveys (CSUR)
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
Optimal conversion of extended-entry decision tables with general cost criteria
Communications of the ACM
Optimizing decision trees through heuristically guided search
Communications of the ACM
The synthetic approach to decision table conversion
Communications of the ACM
Communications of the ACM
Combining decision rules in a decision table
Communications of the ACM
Information theory applied to the conversion of decision tables to computer programs
Communications of the ACM
On the conversion of decision tables to computer programs
Communications of the ACM
Ambiguity in limited entry decision tables
Communications of the ACM
Optimization of imprecise decision tables
ACM-SE 18 Proceedings of the 18th annual Southeast regional conference
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
Decision table programming and reliability
ICSE '76 Proceedings of the 2nd international conference on Software engineering
Factorizing complex predicates in queries to exploit indexes
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Conversion of limited-entry decision tables into optimal decision trees: fundamental concepts
ACM SIGPLAN Notices - Special issue on decision tables
Analysis of Algorithms for the Evaluation of Monotonic Boolean Functions
IEEE Transactions on Computers
Compiling optimized code from decision tables
IBM Journal of Research and Development
Optimized block-based connected components labeling with decision trees
IEEE Transactions on Image Processing
WSEAS Transactions on Information Science and Applications
Optimal decision trees generation from OR-decision tables
ICIAP'11 Proceedings of the 16th international conference on Image analysis and processing: Part I
The pipelined set cover problem
ICDT'05 Proceedings of the 10th international conference on Database Theory
A heuristically 'optimal' knowledge base organization technique
Automatica (Journal of IFAC)
| Hi-index | 0.18 |
This paper begins with a brief description of desicion tables, and then presents a discussion of alternative expressions for them as sequential testing procedures for computer implementation and as Boolean functions. An algorithm is developed which, in a finite number of steps, will convert any given limited entry decision table into an “optimal” computer program, one with minimum average processing time. The algorithm is more general than procedures previously developed and guarantees optimality of the resultant computer program. Previous procedures required two distinct steps and gave no assurance of overall optimality. Computer implementation of the algorithm is also discussed.