Cover: Conversion of Limited-Entry Decision Tables to Computer Programs

Conversion of Limited-Entry Decision Tables to Computer Programs

Published 1964

by Solomon L. Pollack

Purchase Print Copy

 Format Price
Add to Cart Paperback20 pages $20.00

Decision tables are useful for describing a set of complex decision rules based on given sets of conditions. Algorithms that can efficiently convert the tables into computer programs will extend the usefulness of decision tables to computer users. This memorandum describes two such algorithms, based on work done by M. S. Montalbano and extended here to handle dashes and ELSE-decision rules. The first algorithm minimizes the computer storage space; the second minimizes computer running time. During the conversion process, both pinpoint any contradictions or redundancies among the rules in a table. A necessary adjunct to minimizing computer storage or running time is the allowable reduction of the number of rules in a decision table. This memorandum describes a technique for this reduction for pairs, triplets, and quadruplets of rules. The system analyst will find this method most helpful for pairs, and generally unprofitable for n-tuplets greater than three. The technique is used manually or by the computer as a prelude to executing one of the two algorithms. Decision tables are useful for describing a set of complex decision rules based on given sets of conditions. Algorithms that can efficiently convert the tables into computer programs will extend the usefulness of decision tables to computer users. This memorandum describes two such algorithms, based on work done by M. S. Montalbano and extended here to handle dashes and ELSE-decision rules. The first algorithm minimizes the computer storage space; the second minimizes computer running time. During the conversion process, both pinpoint any contradictions or redundancies among the rules in a table. A necessary adjunct to minimizing computer storage or running time is the allowable reduction of the number of rules in a decision table. This memorandum describes a technique for this reduction for pairs, triplets, and quadruplets of rules. The system analyst will find this method most helpful for pairs, and generally unprofitable for n-tuplets greater than three. The technique is used manually or by the computer as a prelude to executing one of the two algorithms. (See also RM-3010, RM-3669, P-2829.)

This report is part of the RAND research memorandum series. The Research Memorandum was a product of RAND from 1948 to 1973 that represented working papers meant to report current results of RAND research to appropriate audiences.

This document and trademark(s) contained herein are protected by law. This representation of RAND intellectual property is provided for noncommercial use only. Unauthorized posting of this publication online is prohibited; linking directly to this product page is encouraged. Permission is required from RAND to reproduce, or reuse in another form, any of its research documents for commercial purposes. For information on reprint and reuse permissions, please visit www.rand.org/pubs/permissions.

RAND is a nonprofit institution that helps improve policy and decisionmaking through research and analysis. RAND's publications do not necessarily reflect the opinions of its research clients and sponsors.