A Sound and Complete Axiomatization of Majority-n Logic

Manipulating logic functions via majority operators recently drew the attention of researchers in computer science. For example, circuit optimization based on majority operators enables superior results as compared to traditional logic systems. Also, the Boolean satisfiability problem finds new solving approaches when described in terms of majority decisions. To support computer logic applications based on majority a sound and complete set of axioms is required. Most of the recent advances in majority logic deal only with ternary majority (MAJ- 3) operators because the axiomatization with solely MAJ-3 and complementation operators is well understood. However, it is of interest extending such axiomatization to n-ary majority operators (MAJ-n) from both the theoretical and practical perspective. In this work, we address this issue by introducing a sound and complete axiomatization of MAJ-n logic. Our axiomatization naturally includes existing majority logic systems. Based on this general set of axioms, computer applications can now fully exploit the expressive power of majority logic.

[1]  S. Datta,et al.  Proposal for an all-spin logic device with built-in memory. , 2010, Nature nanotechnology.

[2]  Pavel Pudlák,et al.  On the computational power of depth 2 circuits with threshold and modulo gates , 1994, STOC '94.

[3]  Kaushik Roy,et al.  Low-power functionality enhanced computation architecture using spin-based devices , 2011, 2011 IEEE/ACM International Symposium on Nanoscale Architectures.

[4]  Richard Lindaman,et al.  A Theorem for Deriving Majority-Logic Networks Within an Augmented Boolean Algebra , 1960, IRE Trans. Electron. Comput..

[5]  Leslie G. Valiant,et al.  Short Monotone Formulae for the Majority Function , 1984, J. Algorithms.

[6]  A Imre,et al.  Majority Logic Gate for Magnetic Quantum-Dot Cellular Automata , 2006, Science.

[7]  Keivan Navi,et al.  A symmetric quantum-dot cellular automata design for 5-input majority gate , 2014 .

[8]  Hao Yu,et al.  Energy efficient in-memory machine learning for data intensive image-processing by non-volatile domain-wall memory , 2014, 2014 19th Asia and South Pacific Design Automation Conference (ASP-DAC).

[9]  H. S. Miller,et al.  Majority-Logic Synthesis by Geometric Methods , 1962, IRE Trans. Electron. Comput..

[10]  Cesare Tinelli,et al.  Handbook of Satisfiability , 2021, Handbook of Satisfiability.

[11]  Frank M. Brown,et al.  Boolean reasoning - the logic of boolean equations , 1990 .

[12]  Rui Zhang,et al.  Threshold network synthesis and optimization and its application to nanotechnologies , 2005, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[13]  D. B. Strukov,et al.  Programmable CMOS/Memristor Threshold Logic , 2013, IEEE Transactions on Nanotechnology.

[14]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[15]  Giovanni De Micheli,et al.  Boolean logic optimization in Majority-Inverter Graphs , 2015, 2015 52nd ACM/EDAC/IEEE Design Automation Conference (DAC).

[16]  Giovanni De Micheli,et al.  Majority-Inverter Graph: A New Paradigm for Logic Optimization , 2016, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[17]  Richard Lindaman,et al.  Axiomatic Majority-Decision Logic , 1961, IRE Trans. Electron. Comput..

[18]  Kaushik Roy,et al.  Design and Synthesis of Ultralow Energy Spin-Memristor Threshold Logic , 2014, IEEE Transactions on Nanotechnology.

[19]  Giovanni De Micheli,et al.  Majority Logic Representation and Satisfiability , 2014 .

[20]  A. Tarski,et al.  Boolean Algebras with Operators , 1952 .

[21]  Guowu Yang,et al.  Majority-based reversible logic gates , 2005, Theor. Comput. Sci..

[22]  Tsutomu Sasao,et al.  Switching Theory for Logic Synthesis , 1999, Springer US.

[23]  E. V. Huntington.  Sets of independent postulates for the algebra of logic , 1904 .

[24]  Giovanni De Micheli,et al.  Synthesis and Optimization of Digital Circuits , 1994 .

[25]  T.J. Dysart,et al.  > Replace This Line with Your Paper Identification Number (double-click Here to Edit) < 1 , 2001 .

[26]  Yan Liu,et al.  Three-input majority logic gate and multiple input logic circuit based on DNA strand displacement. , 2013, Nano letters.

[27]  Yoshihiro Tohma,et al.  Decompositions of Logical Functions Using Majority Decision Elements , 1964, IEEE Trans. Electron. Comput..

[28]  Prasad Shabadi.  Towards Logic Functions as the Device using Spin Wave Functions Nanofabric , 2012 .

[29]  S. Akers.  On the Algebraic Manipulation of Majority Logic , 1961 .

[30]  Earl E. Swartzlander,et al.  Adder and Multiplier Design in Quantum-Dot Cellular Automata , 2009, IEEE Transactions on Computers.

[31]  Fusachika Miyata,et al.  Realization of Arbitrary Logical Functions Using Majority Elements , 1963, IEEE Trans. Electron. Comput..

[32]  Saket Srivastava,et al.  Hierarchical Probabilistic Macromodeling for QCA Circuits , 2007, IEEE Transactions on Computers.

[33]  Ingo Wegener,et al.  The complexity of Boolean functions , 1987 .

[34]  A. Tarski,et al.  Boolean Algebras with Operators. Part I , 1951 .

[35]  Ryan O'Donnell,et al.  Noise stability of functions with low influences: Invariance and optimality , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).

[36]  Wolfgang Porod,et al.  Quantum-Dot Cellular Automata: Line and Majority Logic Gate , 1999 .

[37]  Giovanni De Micheli,et al.  Majority-Inverter Graph: A novel data-structure and algorithms for efficient logic optimization , 2014, 2014 51st ACM/EDAC/IEEE Design Automation Conference (DAC).