Optimal conversion of extended-entry decision tables with general cost criteria
- 1 April 1978
- journal article
- Published by Association for Computing Machinery (ACM) in Communications of the ACM
- Vol. 21 (4) , 269-279
- https://doi.org/10.1145/359460.359469
Abstract
A general dynamic programming algorithm for converting limited, extended, or mixed entry decision tables to optimal decision trees is presented which can take into account rule frequencies or probabilities, minimum time and/or space cost criteria, common action sets, compressed rules and ELSE rules, sequencing constraints on condition tests, excludable combinations of conditions, certain ambiguities, and interrupted rule masking.Keywords
This publication has 13 references indexed in Scilit:
- ACM ForumCommunications of the ACM, 1976
- The synthetic approach to decision table conversionCommunications of the ACM, 1976
- Extending the infomation theory approach to converting limited-entry decision tables to computer programsCommunications of the ACM, 1974
- Comments on the algorithms of Verhelst for the conversion of limited-entry decision tables to flowchartsCommunications of the ACM, 1974
- The conversion of limited-entry decision tables to optimal and near-optimal flowchartsCommunications of the ACM, 1972
- Optimized code generation from extended-entry decision tablesACM SIGPLAN Notices, 1971
- The interpretation of limited entry decision table format and relationships among conditionsThe Computer Journal, 1969
- Conversion of Limited-Entry Decision Tables to Optimal Computer Programs IIJournal of the ACM, 1967
- Conversion of decision tables to computer programs by rule mask techniquesCommunications of the ACM, 1966
- Conversion of limited-entry decision tables to computer programsCommunications of the ACM, 1965