AE1: An extension matrix approximate method for the general covering problem

1. D. S. Johnson, Approximation Algorithm for Combinatorial Problems,J. of Comput. and Systems Sci. 9 (3):38–49 (May 1973).

   Google Scholar 

2. Yu. I. Zhuravlev, O Nevozmozhnosti Postroeniya Minimalnykh Normalnykh Form Funksii Algebry Logiki v Odnom Klasse Algoritmov,Doklady AN SSSR,132 (3):504–506 (1960).

   Google Scholar 

3. I. L. Vasilev, Trudnosti Minimizatsii Bulevykh Funksii na Osnove Universalnykh Podkhodov,Doklady AN SSSR, Vol. 171, No. 1 (1966).

4. R. S. Michalski, On the Quasi-Minimal Solution of the General Covering Problem,Proc. of the Fifth Int. Symp. on Infor. Proc. (FCIP 69), Vol. A3 (Switching Circuits), Yugoslavia, Bled (October 1969).

5. R. S. Michalski, A Variable-Valued Logic and Its Application to Pattern Recognition and Machine Learning,Multiple-Valued Logic and Computer Science, Rine, D. (Ed.), North-Holland, pp. 506–534, (1975).

6. R. S. Michalski, A Theory and Methodology of Inductive Learning,Machine Learning, Michalski, R. S., Carbonell, J. G., and Mitchell, T. M. (Eds.), Tioga Publishing Company, Palo Alto, California, pp. 83–135 (1983).

   Google Scholar 

7. J. R. Hong, User's Guide and Implementation for Automatic Rule Acquisition Program AE1, to appear in Reports of the Intelligent Systems Group, Department of Computer Science, University of Illinois (1986).

8. J. R. Hong, On the Disjoint Extension Matrices Approach in the General Covering Problem, to appear in Reports of the Intelligent Systems Group, Department of Computer Science, University of Illinois (1986).

Download references