{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T15:08:00Z","timestamp":1774451280199,"version":"3.50.1"},"reference-count":77,"publisher":"MDPI AG","issue":"11","license":[{"start":{"date-parts":[[2022,11,5]],"date-time":"2022-11-05T00:00:00Z","timestamp":1667606400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Portland State University Open Access Article Processing Charge Fund","award":["PO 23-24362"],"award-info":[{"award-number":["PO 23-24362"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>In this paper, we proposed a novel quantum algorithm for the maximum satisfiability problem. Satisfiability (SAT) is to find the set of assignment values of input variables for the given Boolean function that evaluates this function as TRUE or prove that such satisfying values do not exist. For a POS SAT problem, we proposed a novel quantum algorithm for the maximum satisfiability (MAX-SAT), which returns the maximum number of OR terms that are satisfied for the SAT-unsatisfiable function, providing us with information on how far the given Boolean function is from the SAT satisfaction. We used Grover\u2019s algorithm with a new block called quantum counter in the oracle circuit. The proposed circuit can be adapted for various forms of satisfiability expressions and several satisfiability-like problems. Using the quantum counter and mirrors for SAT terms reduces the need for ancilla qubits and realizes a large Toffoli gate that is then not needed. Our circuit reduces the number of ancilla qubits for the terms T of the Boolean function from T of ancilla qubits to \u2248log2T+1. We analyzed and compared the quantum cost of the traditional oracle design with our design which gives a low quantum cost.<\/jats:p>","DOI":"10.3390\/e24111615","type":"journal-article","created":{"date-parts":[[2022,11,8]],"date-time":"2022-11-08T11:46:43Z","timestamp":1667908003000},"page":"1615","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Quantum Algorithm for Variant Maximum Satisfiability"],"prefix":"10.3390","volume":"24","author":[{"given":"Abdirahman","family":"Alasow","sequence":"first","affiliation":[{"name":"Department of Electrical & Computer Engineering, Portland State University, Portland, OR 97207, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"Jin","sequence":"additional","affiliation":[{"name":"Department of Electrical & Computer Engineering, Portland State University, Portland, OR 97207, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marek","family":"Perkowski","sequence":"additional","affiliation":[{"name":"Department of Electrical & Computer Engineering, Portland State University, Portland, OR 97207, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2022,11,5]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","unstructured":"Marques-Silva, J., and Glass, T. (1999, January 1). Combinational equivalence checking using satisfiability and recursive learning. Proceedings of the Conference on Design, Automation and Test in Europe, Munich, Germany.","DOI":"10.1145\/307418.307477"},{"key":"ref_2","unstructured":"Konuk, H., and Larrabee, T. (1993, January 6\u20138). Explorations of sequential ATPG using Boolean satisfiability. Proceedings of the Digest of Papers Eleventh Annual 1993 IEEE VLSI Test Symposium, Atlantic City, NJ, USA."},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Biere, A., Cimatti, A., Clarke, E.M., Fujita, M., and Zhu, Y. (1999, January 21\u201325). Symbolic model checking using SAT procedures instead of BDDs. Proceedings of the 36th Annual ACM\/IEEE Design Automation Conference, New Orleans, LA, USA.","DOI":"10.1145\/309847.309942"},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"Hong, T., Li, Y., Park, S.B., Mui, D., Lin, D., Kaleq, Z.A., Hakim, N., Naeimi, H., Gardner, D.S., and Mitra, S. QED: Quick error detection tests for effective post-silicon validation. Proceedings of the 2010 IEEE International Test Conference, Austin, TX, USA, 2\u20134 November 2010.","DOI":"10.1109\/TEST.2010.5699215"},{"key":"ref_5","unstructured":"Wang, P.W., Donti, P., Wilder, B., and Kolter, Z. (2019, January 10\u201315). Satnet: Bridging deep learning and logical reasoning using a differentiable satisfiability solver. Proceedings of the International Conference on Machine Learning, Long Beach, CA, USA."},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Cook, S.A. (1971, January 3\u20135). The complexity of theorem-proving procedures. Proceedings of the Third Annual ACM Symposium on Theory of Computing, Shaker Heights, OH, USA.","DOI":"10.1145\/800157.805047"},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1137\/S0895480191220836","article-title":"The minimum satisfiability problem","volume":"7","author":"Kohli","year":"1994","journal-title":"SIAM J. Discret. Math."},{"key":"ref_8","unstructured":"Biere, A., Heule, M., and van Maaren, H. (2009). Handbook of Satisfiability, IOS Press."},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Fu, Z., and Malik, S. (2006, January 12\u201315). On solving the partial MAX-SAT problem. Proceedings of the International Conference on Theory and Applications of Satisfiability Testing, Seattle, WA, USA.","DOI":"10.1007\/11814948_25"},{"key":"ref_10","unstructured":"Berg, O.J., Hyttinen, A.J., and J\u00e4rvisalo, M.J. (2018, January 7). Applications of MaxSAT in data analysis. Proceedings of the Pragmatics of SAT 2015 and 2018, Oxford, UK."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1016\/j.artint.2015.07.001","article-title":"Cost-optimal constrained correlation clustering via weighted partial maximum satisfiability","volume":"244","author":"Berg","year":"2017","journal-title":"Artif. Intell."},{"key":"ref_12","unstructured":"Berg, J., J\u00e4rvisalo, M., and Malone, B. (2014, January 22\u201325). Learning optimal bounded treewidth Bayesian networks via maximum satisfiability. Proceedings of the Artificial Intelligence and Statistics, Reykjavik, Iceland."},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Hyttinen, A., Saikko, P., and J\u00e4rvisalo, M. (2017, January 19\u201325). A core-guided approach to learning optimal causal graphs. Proceedings of the 26th International Joint Conference on Artificial Intelligence (IJCAI 2017), Melbourne, Australia.","DOI":"10.24963\/ijcai.2017\/90"},{"key":"ref_14","doi-asserted-by":"crossref","unstructured":"Malioutov, D., and Meel, K.S. (2018, January 27\u201331). MLIC: A MaxSAT-based framework for learning interpretable classification rules. Proceedings of the International Conference on Principles and Practice of Constraint Programming, Lille, France.","DOI":"10.1007\/978-3-319-98334-9_21"},{"key":"ref_15","doi-asserted-by":"crossref","unstructured":"Dimitrova, R., Ghasemi, M., and Topcu, U. (2018, January 7\u201310). Maximum realizability for linear temporal logic specifications. Proceedings of the International Symposium on Automated Technology for Verification and Analysis, Los Angeles, CA, USA.","DOI":"10.1007\/978-3-030-01090-4_27"},{"key":"ref_16","doi-asserted-by":"crossref","unstructured":"Zhang, L., and Bacchus, F. (2012, January 22\u201326). MAXSAT heuristics for cost optimal planning. Proceedings of the AAAI Conference on Artificial Intelligence, Toronto, ON, Canada.","DOI":"10.1609\/aaai.v26i1.8373"},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1613\/jair.5128","article-title":"Optimal partial-order plan relaxation via MaxSAT","volume":"57","author":"Muise","year":"2016","journal-title":"J. Artif. Intell. Res."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/s10479-017-2693-y","article-title":"Modeling and solving staff scheduling with partial weighted maxSAT","volume":"275","author":"Musliu","year":"2019","journal-title":"Ann. Oper. Res."},{"key":"ref_19","doi-asserted-by":"crossref","unstructured":"Safarpour, S., Mangassarian, H., Veneris, A., Liffiton, M.H., and Sakallah, K.A. (2007). November. Improved design debugging using maximum satisfiability. Formal Methods in Computer Aided Design (FMCAD'07), IEEE.","DOI":"10.1109\/FMCAD.2007.4401977"},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Chen, Y., Safarpour, S., Veneris, A., and Marques-Silva, J. (2009, January 10\u201312). Spatial and temporal design debug using partial MaxSAT. Proceedings of the 19th ACM Great Lakes symposium on VLSI, Boston Area, MA, USA.","DOI":"10.1145\/1531542.1531621"},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"1804","DOI":"10.1109\/TCAD.2010.2061270","article-title":"Automated design debugging with maximum satisfiability","volume":"29","author":"Chen","year":"2010","journal-title":"IEEE Trans. Comput. Aided Des. Integr. Circuits Syst."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1145\/1993316.1993550","article-title":"Cause clue clauses: Error localization using maximum satisfiability","volume":"46","author":"Jose","year":"2011","journal-title":"ACM SIGPLAN Not."},{"key":"ref_23","unstructured":"Zhu, C.S., Weissenbacher, G., and Malik, S. (November, January 30). Post-silicon fault localisation using maximum satisfiability and backbones. Proceedings of the 2011 Formal Methods in Computer-Aided Design (FMCAD), Austin, TX, USA."},{"key":"ref_24","doi-asserted-by":"crossref","unstructured":"Wickramaarachchi, G.T., Qardaji, W.H., and Li, N. (2009, January 3\u20135). An efficient framework for user authorization queries in RBAC systems. Proceedings of the 14th ACM Symposium on Access Control Models and Technologies, Stresa, Italy.","DOI":"10.1145\/1542207.1542213"},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1587\/transinf.2015EDP7223","article-title":"Reconstructing AES key schedule images with SAT and MaxSAT","volume":"99","author":"Liao","year":"2016","journal-title":"IEICE Trans. Inf. Syst."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1109\/TCAD.2018.2889663","article-title":"PMTP: A MAX-SAT-based approach to detect hardware trojan using propagation of maximum transition probability","volume":"39","author":"Shabani","year":"2018","journal-title":"IEEE Trans. Comput. Aided Des. Integr. Circuits Syst."},{"key":"ref_27","doi-asserted-by":"crossref","unstructured":"Feng, Y., Bastani, O., Martins, R., Dillig, I., and Anand, S. (2016). Automated synthesis of semantic malware signatures using maximum satisfiability. arXiv.","DOI":"10.14722\/ndss.2017.23379"},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1186\/1471-2164-13-S6-S5","article-title":"Application of Max-SAT-based ATPG to optimal cancer therapy design","volume":"13","author":"Lin","year":"2012","journal-title":"BMC Genom."},{"key":"ref_29","doi-asserted-by":"crossref","unstructured":"Guerra, J., and Lynce, I. (2012, January 8\u201312). Reasoning over biological networks using maximum satisfiability. Proceedings of the International Conference on Principles and Practice of Constraint Programming, Qu\u00e9bec City, QC, Canada.","DOI":"10.1007\/978-3-642-33558-7_67"},{"key":"ref_30","unstructured":"Martins, R. (2017). Solving RNA alignment with MaxSAT. MaxSAT Evaluation, University of Helsinki."},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1007\/s10479-009-0675-4","article-title":"Haplotype inference with pseudo-Boolean optimization","volume":"184","author":"Lynce","year":"2011","journal-title":"Ann. Oper. Res."},{"key":"ref_32","doi-asserted-by":"crossref","unstructured":"Li, C.M., and Quan, Z. (2010, January 11\u201315). An efficient branch-and-bound algorithm based on maxsat for the maximum clique problem. Proceedings of the Twenty-fourth AAAI Conference on Artificial Intelligence, Atlanta, GA, USA.","DOI":"10.1609\/aaai.v24i1.7536"},{"key":"ref_33","doi-asserted-by":"crossref","unstructured":"Li, C.M., Jiang, H., and Xu, R.C. (2015, January 12\u201315). Incremental MaxSAT reasoning to reduce branches in a branch-and-bound algorithm for MaxClique. Proceedings of the International Conference on Learning and Intelligent Optimization, Lille, France.","DOI":"10.1007\/978-3-319-19084-6_26"},{"key":"ref_34","unstructured":"Fang, Z., Li, C.M., Qiao, K., Feng, X., and Xu, K. (2014, January 18\u201322). Solving Maximum Weight Clique Using Maximum Satisfiability Reasoning. Proceedings of the ECAI, Prague, Czech."},{"key":"ref_35","doi-asserted-by":"crossref","unstructured":"Berg, J., and J\u00e4rvisalo, M. (2014, January 10\u201312). SAT-based approaches to treewidth computation: An evaluation. Proceedings of the 2014 IEEE 26th International Conference on Tools with Artificial Intelligence, Limassol, Cyprus.","DOI":"10.1109\/ICTAI.2014.57"},{"key":"ref_36","doi-asserted-by":"crossref","first-page":"363","DOI":"10.3233\/FI-2010-311","article-title":"Combinatorial optimization solutions for the maximum quartet consistency problem","volume":"102","author":"Morgado","year":"2010","journal-title":"Fundam. Inform."},{"key":"ref_37","doi-asserted-by":"crossref","unstructured":"Smyth, K., Hoos, H.H., and St\u00fctzle, T. (2003, January 11\u201313). Iterated robust tabu search for MAX-SAT. Proceedings of the Conference of the Canadian Society for Computational Studies of Intelligence, Halifax, NS, Canada.","DOI":"10.1007\/3-540-44886-1_12"},{"key":"ref_38","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/j.ejor.2003.01.005","article-title":"Maximum satisfiability: How good are tabu search and plateau moves in the worst-case?","volume":"166","author":"Mastrolilli","year":"2005","journal-title":"Eur. J. Oper. Res."},{"key":"ref_39","doi-asserted-by":"crossref","first-page":"103354","DOI":"10.1016\/j.artint.2020.103354","article-title":"Old techniques in new ways: Clause weighting, unit propagation and hybridization for maximum satisfiability","volume":"287","author":"Cai","year":"2020","journal-title":"Artif. Intell."},{"key":"ref_40","unstructured":"Marchiori, E., and Rossi, C. (1999, January 13\u201317). A flipping genetic algorithm for hard 3-SAT problems. Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-99), Orlando, FL, USA."},{"key":"ref_41","doi-asserted-by":"crossref","unstructured":"Layeb, A., Deneche, A.H., and Meshoul, S. (2010, January 1\u20134). A new artificial immune system for solving the maximum satisfiability problem. Proceedings of the International Conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems, Cordoba, Spain.","DOI":"10.1007\/978-3-642-13025-0_15"},{"key":"ref_42","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1007\/s10710-009-9091-4","article-title":"Hybrid of genetic algorithm and local search to solve max-sat problem using NVIDIA CUDA framework","volume":"10","author":"Munawar","year":"2009","journal-title":"Genet. Program. Evolvable Mach."},{"key":"ref_43","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1162\/evco.2006.14.2.223","article-title":"GASAT: A genetic local search algorithm for the satisfiability problem","volume":"14","author":"Lardeux","year":"2006","journal-title":"Evol. Comput."},{"key":"ref_44","doi-asserted-by":"crossref","first-page":"394","DOI":"10.1145\/368273.368557","article-title":"A machine program for theorem-proving","volume":"5","author":"Davis","year":"1962","journal-title":"Commun. ACM"},{"key":"ref_45","doi-asserted-by":"crossref","unstructured":"Li, C.M., Manya, F., and Planes, J. (2005, January 1\u20135). Exploiting unit propagation to compute lower bounds in branch and bound Max-SAT solvers. Proceedings of the International Conference on Principles and Practice of Constraint Programming, Sitges, Spain.","DOI":"10.1007\/11564751_31"},{"key":"ref_46","unstructured":"Li, C.M., Xu, Z., Coll, J., Many\u00e0, F., Habet, D., and He, K. (2021, January 25\u201329). Combining clause learning and branch and bound for MaxSAT. Proceedings of the 27th International Conference on Principles and Practice of Constraint Programming (CP 2021), Montpellier, France."},{"key":"ref_47","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1145\/130836.130837","article-title":"Efficient local search for very large-scale satisfiability problems","volume":"3","author":"Gu","year":"1992","journal-title":"ACM SIGART Bull."},{"key":"ref_48","doi-asserted-by":"crossref","unstructured":"Bian, Z., Chudak, F., Macready, W., Roy, A., Sebastiani, R., and Varotti, S. (2017, January 27\u201329). Solving sat and maxsat with a quantum annealer: Foundations and a preliminary report. Proceedings of the International Symposium on Frontiers of Combining Systems, Bras\u00edlia, Brazil.","DOI":"10.1007\/978-3-319-66167-4_9"},{"key":"ref_49","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/j.jcss.2006.09.003","article-title":"Quantum cooperative search algorithm for 3-SAT","volume":"73","author":"Cheng","year":"2007","journal-title":"J. Comput. Syst. Sci."},{"key":"ref_50","first-page":"561","article-title":"The cost of Quantum Gate Primitives","volume":"12","author":"Lee","year":"2006","journal-title":"J. Mult. Valued Log. Soft Comput."},{"key":"ref_51","doi-asserted-by":"crossref","first-page":"3457","DOI":"10.1103\/PhysRevA.52.3457","article-title":"Elementary gates for quantum computation","volume":"52","author":"Barenco","year":"1999","journal-title":"Phys. Rev. A"},{"key":"ref_52","doi-asserted-by":"crossref","first-page":"1790","DOI":"10.1049\/el:20031202","article-title":"Improved quantum cost for n-bit Toffoli gates","volume":"39","author":"Maslov","year":"2003","journal-title":"Electron. Lett."},{"key":"ref_53","doi-asserted-by":"crossref","first-page":"3266","DOI":"10.1103\/PhysRevA.32.3266","article-title":"Reversible logic and quantum computers","volume":"32","author":"Peres","year":"1985","journal-title":"Phys. Rev. A"},{"key":"ref_54","doi-asserted-by":"crossref","unstructured":"Szyprowski, M., and Kerntopf, P. (2013, January 5\u20138). Low quantum cost realization of generalized peres and toffoli gates with multiple-control signals. Proceedings of the 2013 13th IEEE International Conference on Nanotechnology (IEEE-NANO 2013), Beijing, China.","DOI":"10.1109\/NANO.2013.6721034"},{"key":"ref_55","doi-asserted-by":"crossref","unstructured":"Nielsen, M.A., and Chuang, I. (2002). Quantum Computation and Quantum Information, Cambridge University Press.","DOI":"10.1119\/1.1463744"},{"key":"ref_56","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1109\/TNB.2021.3065051","article-title":"Quantum speedup for protein structure prediction","volume":"20","author":"Wong","year":"2021","journal-title":"IEEE Trans. NanoBiosci."},{"key":"ref_57","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1109\/TNB.2021.3075733","article-title":"Quantum speedup and mathematical solutions of implementing bio-molecular solutions for the independent set problem on IBM quantum computers","volume":"20","author":"Chang","year":"2021","journal-title":"IEEE Trans. NanoBiosci."},{"key":"ref_58","doi-asserted-by":"crossref","first-page":"178","DOI":"10.1016\/j.jpdc.2022.03.011","article-title":"Fast quantum algorithm for protein structure prediction in hydrophobic-hydrophilic model","volume":"164","author":"Wong","year":"2022","journal-title":"J. Parallel Distrib. Comput."},{"key":"ref_59","unstructured":"Aleksandrowicz, G., Alexander, T., Barkoutsos, P., Bello, L., Ben-Haim, Y., Bucher, D., Cabrera-Hern\u00e1ndez, F.J., Carballo-Franquis, J., Chen, A., and Chen, C.F. (2019). Qiskit: An Open-Source Framework for Quantum Computing, Zenodo."},{"key":"ref_60","doi-asserted-by":"crossref","unstructured":"Perkowski, M. (2020, January 9\u201310). Inverse Problems, Constraint Satisfaction, Reversible Logic, Invertible Logic and Grover Quantum Oracles for Practical Problems. Proceedings of the International Conference on Reversible Computation, Oslo, Norway.","DOI":"10.1007\/978-3-030-52482-1_1"},{"key":"ref_61","doi-asserted-by":"crossref","unstructured":"Alasow, A., and Perkowski, M. (2022, January 18\u201320). Quantum Algorithm for Maximum Satisfiability. Proceedings of the 2022 IEEE 52nd International Symposium on Multiple-Valued Logic (ISMVL), Dallas, TX, USA.","DOI":"10.1109\/ISMVL52857.2022.00012"},{"key":"ref_62","unstructured":"Csanky, L. (1972). On the Generalized Reed-Muller Canonical Form of Boolean Functions: Research Project. [Ph.D. Thesis, University of California]."},{"key":"ref_63","unstructured":"Garey, M.R., and Johnson, D.S. (1979). A Guide to the Theory of NP-Completeness. Computers and Intractability, W. H. Freeman & Co."},{"key":"ref_64","unstructured":"Lin, H.P., Jiang, J.H.R., and Lee, R.R. (2008, January 10\u201313). To SAT or not to SAT: Ashenhurst decomposition in a large scale. Proceedings of the 2008 IEEE\/ACM International Conference on Computer-Aided Design, San Jose, CA, USA."},{"key":"ref_65","first-page":"35","article-title":"Grover-based Ashenhurst-Curtis decomposition using quantum language quipper","volume":"19","author":"Li","year":"2019","journal-title":"Quantum Inf. Comput."},{"key":"ref_66","unstructured":"Breuer, M.A., and Preiss, R.J. (1972). Design Automation of Digital Systems, Prentice Hall."},{"key":"ref_67","unstructured":"Slagle, J.R. (1971). Artificial Intelligence: The Heuristic Programming Approach, McGraw-Hill."},{"key":"ref_68","doi-asserted-by":"crossref","unstructured":"Kohavi, Z., and Jha, N.K. (2009). Switching and Finite Automata Theory, Cambridge University Press.","DOI":"10.1017\/CBO9780511816239"},{"key":"ref_69","doi-asserted-by":"crossref","unstructured":"Lieberherr, K., and Specker, E. (1979, January 29\u201331). Complexity of partial satisfaction. Proceedings of the 20th Annual Symposium on Foundations of Computer Science (sfcs 1979), Washington, DC, USA.","DOI":"10.1109\/SFCS.1979.9"},{"key":"ref_70","unstructured":"Perkowski, M. (1978). State-Space Approach to the Design of a Multipurpose Problem-Solver for Logic Design, KU Leuven."},{"key":"ref_71","unstructured":"Perkowski, M. (1976, January 3\u20135). Synthesis of multioutput three level NAND networks. Proceedings of the Seminar on Computer Aided Design, Budapest, Hungary."},{"key":"ref_72","unstructured":"Perkowski, M. (1986, January 10\u201312). Minimization of two-level networks from negative gates. Proceedings of the Midwest, Lincoln, Nebraska."},{"key":"ref_73","unstructured":"Perkowski, M., Liu, J., and Brown, J. (1987, January 17\u201318). A System for Fast Prototyping of Logic Design Programs. Proceedings of the 1987 Midwest Symposium on Circuits and Systems, Syracuse, NY, USA."},{"key":"ref_74","doi-asserted-by":"crossref","first-page":"879","DOI":"10.1109\/TC.1984.1676349","article-title":"Input variable assignment and output phase optimization of PLA\u2019s","volume":"33","author":"Sasao","year":"1984","journal-title":"IEEE Trans. Comput."},{"key":"ref_75","unstructured":"Nilsson, J. (1971). Problem-Solving Methods in Artificial Intelligence, McGraw-Hill."},{"key":"ref_76","unstructured":"Nguyen, L.B., Perkowdki, M.A., and Goldstein, N.B. (July, January 28). Palmini\u2014Fast Boolean minimizer for personal computers. Proceedings of the 24th ACM\/IEEE Design Automation Conference, Miami Beach, FL, USA."},{"key":"ref_77","unstructured":"Perkowski, M., and Mishchenko, A. (2002, January 19\u201320). Logic synthesis for regular layout using satisfiability. Proceedings of the International Symposium on Boolean Problems, Freiberg, Germany."}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/24\/11\/1615\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T01:11:14Z","timestamp":1760145074000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/24\/11\/1615"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,11,5]]},"references-count":77,"journal-issue":{"issue":"11","published-online":{"date-parts":[[2022,11]]}},"alternative-id":["e24111615"],"URL":"https:\/\/doi.org\/10.3390\/e24111615","relation":{},"ISSN":["1099-4300"],"issn-type":[{"value":"1099-4300","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,11,5]]}}}