| Conversion of limited-entry decision tables to computer programs |
| Full text |
Pdf
(810 KB)
|
Source
|
Communications of the ACM
archive
Volume 8 , Issue 11 (November 1965)
table of contents
Pages: 677 - 682
Year of Publication: 1965
ISSN:0001-0782
|
|
Author
|
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 3, Downloads (12 Months): 17, Citation Count: 28
|
|
|
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
For a description of decision table structure, see POLLACK, S. L. Analysis of decision rules in decision tables RM-2669-PR. The RAND Corp., Santa Monica, Calif., May 1963.
|
| |
2
|
Decision tables with condition limited-entry are a special class of tables that limit entries to "Y" for Yes, "N" for No, and "-" for immaterial or not relevant. Any other type of decision table can be transformed to limited-entry. Wim Boerdam, of Richfiled Oil, has done some excellent work in thia area
|
| |
3
|
For consolidation of two rules wih identical actions, see Pollack, S. L. How to Build and Analyze Decision Tables. P-2829, The RAND Corporation, November 1963.
|
| |
4
|
The two algorithms are based upon "the quick rule" and "delayed rule" methods described in MONTALBANO, M S. Tables, flow charts, and program logic. IBM syst. J. (Sept. 1962)
|
|