NPN class(Negation Permutation Negation)

LEXSAT

find the minimum satisfying assignment:

• Initialize an all-zero array A
• 遍历 MSB->LSB
  Algorithm 1 [2]
  
  Algorithm 2(Knuth)
  
  可视作一个LEX优化问题：
  $min:lex$
  $s.t.$ All satisfying assignment for the given CNF

find the maximum satisfying assignment:

• Initialize an all-one array A
• 遍历 MSB->LSB
  

Moreover, find the closet larger or smaller assignment of the present asignment

Fomulation:
$min:|as{s}^{\prime }-ass|$
$s.t.$ $|as{s}^{\prime }-ass\ne 0|$

Heuristic NPN Classification

Main idea:
Given a Boolean function $f$, find its corresponding NPN class representative $r(f)$
<=> find the smallest lex function in its NPN class $[f]$
=relax=> 在遍历的NPN等价的functions中找出LEX minimum Boolean functions (找到局部最优解 )。

Encoding as a lex optimization problem

1. encode the truth table as lex, such as:

• Example
  OR gate $f(X)=x_1\vee x_2$, its corresponding lex is $0111$ ($0$ corresponds to the function value with the assignment $00$). Its NPN class representative $r(f)=\overline{{\bar{x}}_1\vee {\bar{x}}_2}$ has a lex $0001$ smaller than $0111$.

2. Given two NPN equal Boolean functions $g$ and $h$, then $g<h$ if and only if:
   $g\ne h$ and $g(min(g\oplus h))=0$

• Example
  $g=x_1\vee x_2$ ， $h=\overline{{\bar{x}}_1\vee {\bar{x}}_2}$. $min(g\oplus h)=01$ and $g(01)=0$. Thus $g<h$.

3. NPN(Input negation&Variable Permuation&Output negation) Class
   布尔函数$f(x)$，它的NPN class定义为$[f]$，另外一个布尔函数$g(x)$，$f$和$g$是NPN等价，当且仅当$[f]=[g]$。$[f]$的 NPN class representative定义为 $r(f)$（$r(f){\le }_{lex}g$ for $\forall g\in [f]$）。

• Example
  $f(X)=x_1\vee x_2$ => $r(f)=\overline{{\bar{x}}_1\vee {\bar{x}}_2}$

4. As NPN equal can be easily achieved in AIG, the NPN classification is implemented through AIG. The algorithm consists of three steps [1]:
   

[1] Soeken M , Mishchenko A , Petkovska A , et al. Heuristic NPN Classification for Large Functions Using AIGs and LEXSAT[C]// International Conference on Theory and Applications of Satisfiability Testing. Springer International Publishing, 2016.
[2] Mishchenko A , Brayton R , Petkovska A , et al. Canonical computation without canonical representation[C]// the 55th Annual Design Automation Conference. 2018.