This Article 
 Bibliographic References 
 Add to: 
Comments on 'Algorithmic State Machine Design and Automatic Theorem Proving: Dual Approaches to the Same Activity'
June 1989 (vol. 38 no. 6)
pp. 880-881
Although the P-functions of the original paper are an aesthetically pleasing method for optimizing binary decision programs, existing procedures are probably more efficient. Current research applying Prolog to the automatic design of microprograms is outlined.

[1] S. Ganapathy and V. Rajamaran, "Information theory applied to the conversion of decision tables to computer programs,"Commun. ACM, vol. 16, pp. 532-539, Sept. 1973.
[2] C. R. P. Hartmann, P. K. Varshney, K. G. Mehrotra, and C. L. Gerberich, "Application of information theory to the construction of efficient decision trees,"IEEE Trans. Inform. Theory, vol. IT-28, pp. 565-577, July 1982.
[3] L. Hyafil and R. L. Rivest, "Constructing optimal binary decision trees is NP-complete,"Inform. Processing Lett., vol. 5, pp. 15-17, May 1976.
[4] M. Karasick, "Binary decision tree reduction," Tech. Rep. SOCS- 84.16, McGill Univ., 1984.
[5] O. P. Kuznetov, "Program realizations of logical functions and automata,"Automat. Remote Contr., vol. 38, pp. 1077-1087 (part 1) and pp. 1385-1395 (part 2), 1977.
[6] B. M. E. Moret, "Decision trees and diagrams,"Comput. Surveys, vol. 14, no. 4, pp. 593-623, 1982.
[7] S. L. Pollack, "Comment on the conversion of decision programs,"Commun. ACM, Vol. 14, p. 52, Jan. 1971.
[8] H. Schumacher and K.C. Sevcik, "The synthetic approach to decision table conversion,"Commun. ACM, vol. 19, pp. 343-351, June 1976.
[9] K. Shwayder, "Conversion of limited-entry decision tables to computer programs-A proposed modification to Pollack's algorithm,"Commun. ACM, vol. 14, pp. 69-73, Feb. 1971.
[10] K. Shwayder, "Extending the information theory approach to converting limited-entry decision tables to computer programs,"Commun. ACM, vol. 17, pp. 532-537, Sept. 1974.
[11] P. K. Varshney, C. R. P. Hartman, and J. M. de Faria, "Applications of information theory to sequential fault diagnosis,"IEEE Trans. Comput., vol. C-31, pp. 164-169, Feb. 1982.
[12] M. Verhelst, "The conversion of limited-entry decision tables to optimal and near optimal flowcharts: Two new algorithms,"Commun. ACM, vol 15, pp. 974-980, Nov. 1972.
[13] R. Vogrig, P. Baracos, P. Lhoste, G. Morel, and B. Salzeman, "Exploitation d'un Ilot Flexible," inProc. 18th CIRP MFS-S, Stuttgart, Germany, June 4 and 5, 1986.
[14] K. L. Clarke and F. G. McCabe,Micro-PROLOG: Programming in Logic. Englewood Cliffs, NJ: Prentice-Hall, 1984, ch. 13, pp. 341-364 (contributed by R. A. Kowalski and M. J. Sergot).

Index Terms:
gorithmic state machine; state machine design; automatic theorem proving; P-functions; binary decision programs; Prolog; automatic design; microprograms; decision tables; microprogramming; PROLOG; theorem proving.
L. Vroomen, P. Zsombor-Murray, P. Baracos, R. Hudson, "Comments on 'Algorithmic State Machine Design and Automatic Theorem Proving: Dual Approaches to the Same Activity'," IEEE Transactions on Computers, vol. 38, no. 6, pp. 880-881, June 1989, doi:10.1109/12.24299
Usage of this product signifies your acceptance of the Terms of Use.