Inductive Interference

Next: Pigeon Hole Problem Up: Some SAT Benchmarks Visualised Previous: 2 Bit Adder

Inductive Interference

Boolean function synthesis: the problem of identifying a hidden Boolean function using outputs obtained by applying a limited number of random inputs to the hidden function as encoded as a satisfiability problem [3]. From the DIMACS benchmark suite, problem ii8a1.cnf. Again there is a strong sense of modularity and repetition, most accentuated by the interpretation using the cooccurrence of literals.

**Figure 4:** Inductive Interference, Cooccurrence of Variables
$\begin{figure}\epsfig{figure=images/ii8a1_vco,width=\textwidth} \end{figure}$

**Figure 5:** Inductive Interference, Cooccurrence of Literals
$\begin{figure}\epsfig{figure=images/ii8a1_lco,width=\textwidth} \end{figure}$

**Figure 6:** Inductive Interference, Basic Implicative Interpretation
$\begin{figure}\epsfig{figure=images/ii8a1_imp,width=\textwidth} \end{figure}$

Last modified: 2004-03-17
Andrew Slater