{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,27]],"date-time":"2026-05-27T12:57:03Z","timestamp":1779886623760,"version":"3.53.1"},"reference-count":48,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[2001,6,1]],"date-time":"2001-06-01T00:00:00Z","timestamp":991353600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Systems Architecture"],"published-print":{"date-parts":[[2001,6]]},"DOI":"10.1016\/s1383-7621(00)00060-6","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T17:10:08Z","timestamp":1027617008000},"page":"477-489","source":"Crossref","is-referenced-by-count":8,"title":["Baldwinian learning utilizing genetic and heuristic algorithms for logic synthesis and minimization of incompletely specified data with Generalized Reed\u2013Muller (AND\u2013EXOR) forms"],"prefix":"10.1016","volume":"47","author":[{"given":"Karen M","family":"Dill","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Marek A","family":"Perkowski","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S1383-7621(00)00060-6_BIB1","series-title":"Field Extensions and Galois Theory","author":"Batisda","year":"1984"},{"issue":"6","key":"10.1016\/S1383-7621(00)00060-6_BIB2","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1049\/ip-cdt:19982342","article-title":"Adaptive exact optimisation of minimally testable FPRM expansions","volume":"145","author":"Chang","year":"1998","journal-title":"IEE Proc. \u2013 Comput. Digit. Tech."},{"key":"10.1016\/S1383-7621(00)00060-6_BIB3","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1109\/TEC.1962.5219363","article-title":"Inconsistent canonical forms of switching functions","volume":"11","author":"Cohn","year":"1962","journal-title":"IRE Trans. Electron. Comput."},{"key":"10.1016\/S1383-7621(00)00060-6_BIB4","doi-asserted-by":"crossref","unstructured":"D. Debnath, T. Sasao, GRMIN: a heuristic simplification algorithm for generalized Reed\u2013Muller expressions, in: IFIP WG 10.5, Proceedings of the Workshop on Applications of the Reed\u2013Muller Expansion in Circuit Design, 27\u201329 August 1995, Makuhari, Chiba, Japan","DOI":"10.1145\/224818.224919"},{"issue":"6","key":"10.1016\/S1383-7621(00)00060-6_BIB5","doi-asserted-by":"crossref","DOI":"10.1049\/ip-cdt:19960826","article-title":"GRMIN2: a heuristic simplification algorithm for generalised Reed\u2013Muller expressions","volume":"143","author":"Debnath","year":"1996","journal-title":"IEE Proc. \u2013 Comput. Digit. Tech."},{"key":"10.1016\/S1383-7621(00)00060-6_BIB6","doi-asserted-by":"crossref","unstructured":"K.M. Dill, Growing digital circuits: logic synthesis and minimization with genetic operators, M.S. Thesis, Department of Electrical and Computer Engineering, Oregon State University, June 1997","DOI":"10.1109\/PACRIM.1997.620386"},{"key":"10.1016\/S1383-7621(00)00060-6_BIB7","unstructured":"K.M. Dill, M.A. Perkowski, Evolutionary minimization of generalized Reed\u2013Muller forms, in: Proceedings of the International Conference on Computational Intelligence and Multimedia 1998 (ICCIMA'98), Monash University, Churchill, Vic, Australia, 9\u201311 February 1998"},{"key":"10.1016\/S1383-7621(00)00060-6_BIB8","unstructured":"K.M. Dill, M.A. Perkowski, Minimization of generalized Reed\u2013Muller forms with a genetic algorithm, in: Proceedings of Genetic Programming '97, July 1997, Stanford University, CA"},{"key":"10.1016\/S1383-7621(00)00060-6_BIB9","unstructured":"K.M. Dill, Ph.D. Dissertation, Department of Electrical Engineering, Portland State University, forthcoming"},{"key":"10.1016\/S1383-7621(00)00060-6_BIB10","doi-asserted-by":"crossref","unstructured":"R. Drechsler, B. Becker, N. Gockel, A genetic algorithm for minimization of fixed polarity Reed\u2013Muller expressions, in: Proceedings of the International Conference on Artificial Neural Networks and Genetic Algorithms, Ales, 1995, pp. 392\u2013395","DOI":"10.1007\/978-3-7091-7535-4_102"},{"key":"10.1016\/S1383-7621(00)00060-6_BIB11","unstructured":"R. Drechsler, Evolutionary algorithms for computer aided design of integrated circuits, in: Proceedings of the International Symposium On IC-Technology, Systems, and Applications, Singapore, 1997, pp. 302\u2013311"},{"key":"10.1016\/S1383-7621(00)00060-6_BIB12","unstructured":"R. Drechsler, H. Hengster, H. Schaefer, J. Hartmann, B. Becker, Testability of 2-level AND\/EXOR circuits, J. Electron. Testing, Theory Appl. (JETTA) 1999"},{"key":"10.1016\/S1383-7621(00)00060-6_BIB13","series-title":"Evolutionary Algorithms for VLSI CAD","author":"Drechsler","year":"1998"},{"key":"10.1016\/S1383-7621(00)00060-6_BIB14","series-title":"Logic Testing and Design for Testability, Computer Science Series","author":"Fujiwara","year":"1986"},{"key":"10.1016\/S1383-7621(00)00060-6_BIB15","series-title":"Genetic Algorithms in Search Optimization and Machine Learning","author":"Goldberg","year":"1989"},{"key":"10.1016\/S1383-7621(00)00060-6_BIB16","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1080\/00207219108921277","article-title":"Families of Reed\u2013Muller canonical forms","volume":"70","author":"Green","year":"1991","journal-title":"Int. J. Electron."},{"key":"10.1016\/S1383-7621(00)00060-6_BIB17","unstructured":"B.A. Julstrom, Comparing Darwinian, Baldwinian, and Lamarckian search in a genetic algorithm for the 4-cycle problem, in: S. Brave, A.S. Wu (Eds.), Late Breaking Papers at the 1999 Genetic and Evolutionary Computation Conference, GECCO'99, 14\u201317 July 1999, Orlando, FL, pp. 134\u2013138"},{"key":"10.1016\/S1383-7621(00)00060-6_BIB18","doi-asserted-by":"crossref","unstructured":"B.A. Julstrom, Seeding the population: improved performance in a genetic algorithm for the rectilinear steiner problem, in: E. Deaton, D. Oppenheim, J. Urban, H. Berghel (Eds.), Applied Computing 1994: Proceedings of the 1994 ACM Symposium on Applied Computing, SAC'94, 6\u20138 March 1994, Phoenix, AZ, Association for Computing Machinery, New York, pp. 222\u2013226","DOI":"10.1145\/326619.326728"},{"key":"10.1016\/S1383-7621(00)00060-6_BIB19","unstructured":"U. Kalay, D.V. Hall, M.A. Perkowski, Easily testable multiple-valued Galois Field Sum-of-Products circuits, J. Multiple-Valued Logic, January 1999, accepted"},{"key":"10.1016\/S1383-7621(00)00060-6_BIB20","doi-asserted-by":"crossref","unstructured":"U. Kalay, M. Perkowski, D. Hall, A minimal universal test set for self test of EXOR-Sum-of-Products circuits, IEEE Trans. Comput., July 1999, accepted","DOI":"10.1109\/12.841130"},{"key":"10.1016\/S1383-7621(00)00060-6_BIB21","doi-asserted-by":"crossref","unstructured":"U. Kalay, N. Venkataramaiah, A. Mishchenko, D. Hall, M. Perkowski, Highly testable finite state machines based on EXOR logic, in: Proceedings of the Seventh IEEE Pacific Rim Conference on Communications, Computers, and Signal Processing, Victoria, BC, Canada, 23\u201325 August 1999","DOI":"10.1109\/PACRIM.1999.799570"},{"issue":"3","key":"10.1016\/S1383-7621(00)00060-6_BIB22","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1080\/00207219308907124","article-title":"Optimization of Reed\u2013Muller logic functions","volume":"75","author":"McKenzie","year":"1993","journal-title":"Int. J. Electron."},{"key":"10.1016\/S1383-7621(00)00060-6_BIB23","doi-asserted-by":"crossref","first-page":"601","DOI":"10.1080\/00207219408925956","article-title":"Using a genetic algorithm for optimizing fixed polarity Reed\u2013Muller expansions of Boolean functions","volume":"76","author":"Miller","year":"1994","journal-title":"Int. J. Electron."},{"key":"10.1016\/S1383-7621(00)00060-6_BIB24","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1080\/00207219408925904","article-title":"A highly efficient exhaustive search algorithm for optimizing canonical Reed\u2013Muller expansions of Boolean functions","volume":"76","author":"Miller","year":"1994","journal-title":"Int. J. Electron."},{"key":"10.1016\/S1383-7621(00)00060-6_BIB25","unstructured":"M. Perkowski, L. Csanky, A. Sarabi, I. Schafer, Minimization of mixed-polarity AND\/XOR forms, in: Proceedings of the IEEE International conference on computer design, ICCD'92, 11\u201313 October 1992, Boston, MA, 1992, pp. 32\u201336"},{"key":"10.1016\/S1383-7621(00)00060-6_BIB26","unstructured":"M. Perkowski, L. Jozwiak, R. Drechsler, A canonical AND\/EXOR form that includes both the Generalized Reed\u2013Muller forms and Kronecker Reed\u2013Muller forms, in: Proceedings of the Reed\u2013Muller 1997 Conference, Oxford University, UK, September 1997, pp. 219\u2013233"},{"key":"10.1016\/S1383-7621(00)00060-6_BIB27","unstructured":"M. Perkowski, U. Kalay, D. Hall, A. Shahjahan, Rectangular covering factorization of ESOPs into scan-based levelized circuits with universal test set, in: Proceedings of Reed\u2013Muller `99, University of Victoria, Victoria, BC, Canada, 20\u201321 August 1999"},{"key":"10.1016\/S1383-7621(00)00060-6_BIB28","unstructured":"D.K. Pradhan, Fault-tolerant Computing: Theory and Techniques, vol. 1, Prentice-Hall, Upper Saddle River, NJ, 1987"},{"key":"10.1016\/S1383-7621(00)00060-6_BIB29","doi-asserted-by":"crossref","first-page":"1183","DOI":"10.1109\/T-C.1972.223475","article-title":"Easily testable realizations for logic functions","volume":"21","author":"Reddy","year":"1972","journal-title":"IEEE Trans. Comput."},{"issue":"4","key":"10.1016\/S1383-7621(00)00060-6_BIB30","first-page":"355","article-title":"Low-complexity synthesis of incompletely specified multiple-output mod-2 sums","volume":"139","author":"Riege","year":"1992","journal-title":"IEE Proc. E"},{"issue":"4","key":"10.1016\/S1383-7621(00)00060-6_BIB31","first-page":"321","article-title":"Syntactic translation and logic synthesis in gatemap","volume":"136","author":"Salmon","year":"1989","journal-title":"IEE Proceedings, Part E"},{"key":"10.1016\/S1383-7621(00)00060-6_BIB32","unstructured":"A. Sarabi, M. Perkowski, Design for testability properties of AND\/XOR networks, in: IFIP WG10.5, Proceedings of the Workshop on Applications of the Reed\u2013Muller Expansion in Circuit Design, 1993, pp. 147\u2013153"},{"key":"10.1016\/S1383-7621(00)00060-6_BIB33","doi-asserted-by":"crossref","unstructured":"A. Sarabi, M.A. Perkowski, Fast exact and quasi-minimal minimization of highly testable fixed-polarity AND\/XOR canonical networks, in: Proceedings of the 1992 IEEE Design Automation Conference, June 1992, pp. 30\u201335","DOI":"10.1109\/DAC.1992.227867"},{"key":"10.1016\/S1383-7621(00)00060-6_BIB34","doi-asserted-by":"crossref","unstructured":"T. Sasao, A transformation of multiple-valued input two-valued output functions and its application to simplification of Exclusive-Or Sum-of-Products expresions, in: Proceedings of the International Symposium on Multi-valued Logic, 1991 (ISMVL-91), May 1991, pp. 270\u2013279","DOI":"10.1109\/ISMVL.1991.130742"},{"issue":"2","key":"10.1016\/S1383-7621(00)00060-6_BIB35","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1109\/12.45212","article-title":"On the complexity of MOD-2 sum PLAs","volume":"39","author":"Sasao","year":"1990","journal-title":"IEEE Trans. Comput."},{"issue":"6","key":"10.1016\/S1383-7621(00)00060-6_BIB36","doi-asserted-by":"crossref","first-page":"709","DOI":"10.1109\/12.600830","article-title":"Easily testable realizations for generalized Reed\u2013Muller expressions","volume":"46","author":"Sasao","year":"1997","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S1383-7621(00)00060-6_BIB37","series-title":"Logic Synthesis and Optimization","author":"Sasao","year":"1993"},{"key":"10.1016\/S1383-7621(00)00060-6_BIB38","unstructured":"T. Sasao, On the complexity of some classes of AND\u2013EXOR expressions, IEICE Technical Report FTS 91-35, October 1991"},{"key":"10.1016\/S1383-7621(00)00060-6_BIB39","doi-asserted-by":"crossref","unstructured":"J. Saul, Logic synthesis for arithmetic circuits using the Reed\u2013Muller representation, in: Proceedings of the European Conference on Design Automation, 1992, pp. 109\u2013113","DOI":"10.1109\/EDAC.1992.205904"},{"key":"10.1016\/S1383-7621(00)00060-6_BIB40","doi-asserted-by":"crossref","unstructured":"N. Song, Minimization of exclusive sum of products expressions for multiple-valued input incompletely specified functions, Master of Science Thesis, Portland State University, Portland, OR, 1993","DOI":"10.1109\/ISMVL.1993.289569"},{"key":"10.1016\/S1383-7621(00)00060-6_BIB41","doi-asserted-by":"crossref","unstructured":"I. Stewart, Galois Theory, second ed., Chapman & Hall, New York, 1989","DOI":"10.1007\/978-94-009-0839-0"},{"key":"10.1016\/S1383-7621(00)00060-6_BIB42","unstructured":"P. Turney, Myths and legends of the Baldwin effect, in: Proceedings of the Workshop on Evolutionary Computing and Machine Learning at the 13th International Conference on Machine Learning, ICML'96, Bari, Italy, pp. 135\u2013142"},{"issue":"2","key":"10.1016\/S1383-7621(00)00060-6_BIB43","first-page":"85","article-title":"Computation of Reed\u2013Muller expansions of incompletely specified boolean functions from reduced representations","volume":"138","author":"Varma","year":"1991","journal-title":"IEE Proc. E"},{"key":"10.1016\/S1383-7621(00)00060-6_BIB44","doi-asserted-by":"crossref","unstructured":"W. Wan, M.A. Perkowski, A new approach to the decomposition of incompletely specified functions based on graph-coloring and local transformations and its application to FPGA mapping, in: Proceedings of the IEEE EURO-DAC'92, European Design Automation Conference, 7\u201310 September 1992, Hamburg, Germany, pp. 230\u2013235","DOI":"10.1109\/EURDAC.1992.246238"},{"key":"10.1016\/S1383-7621(00)00060-6_BIB45","unstructured":"A. Zakrevskij, Minimum polynomial implementation of systems of incompletely specified Boolean functions, in: IFIP WG 10.5, Proceedings of the Workshop on Applications of the Reed\u2013Muller Expansion in Circuit Design, 27\u201329 August 1995, Makuhari, Chiba, Japan"},{"issue":"9","key":"10.1016\/S1383-7621(00)00060-6_BIB46","doi-asserted-by":"crossref","first-page":"1084","DOI":"10.1109\/12.537134","article-title":"Generalized partially-mixed-polarity Reed\u2013Muller expansion and its fast computation","volume":"45","author":"Wu","year":"1996","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S1383-7621(00)00060-6_BIB47","unstructured":"X. Zeng, M. Perkowski, K. Dill, A. Sarabi, Approximate minimization of generalized Reed\u2013Muller forms, in: IFIP WG 10.5, Proceedings of the Workshop on Applications of the Reed\u2013Muller Expansion in Circuit Design, 27\u201329 August 1995, Makuhari, Chiba, Japan"},{"issue":"8","key":"10.1016\/S1383-7621(00)00060-6_BIB48","doi-asserted-by":"crossref","first-page":"1012","DOI":"10.1109\/12.403717","article-title":"A multiple-valued Reed\u2013Muller transform for incompletely specified functions","volume":"44","author":"Zilic","year":"1995","journal-title":"IEEE Trans. Comput."}],"container-title":["Journal of Systems Architecture"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1383762100000606?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1383762100000606?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,17]],"date-time":"2020-01-17T16:45:17Z","timestamp":1579279517000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1383762100000606"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,6]]},"references-count":48,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2001,6]]}},"alternative-id":["S1383762100000606"],"URL":"https:\/\/doi.org\/10.1016\/s1383-7621(00)00060-6","relation":{},"ISSN":["1383-7621"],"issn-type":[{"value":"1383-7621","type":"print"}],"subject":[],"published":{"date-parts":[[2001,6]]}}}