Simplification.SimpleInner
Back to table
/*
Logic-Function-Analysis
Simplification.SimpleInner
[LogicFunction g]=Simplification.SimpleInner(LogicFunction f);
f : a logic function
g : a logic function may in the simpler form
Simplify a logic function with the simple-inner algorithm.
*/
//-------------------------------------------------------------------
// examples
P=AndOr(){
1,2 ;
-1,3 ;
-1,-2,3 ;
-1,-2,-3 ;
1,2,3 ;
}
[f]=Simplification.SimpleInner(P);
Print(f);
//-------------------------------------------------------------------
// result
IsPositiveUnateFunctionTo IsSelfAntiDualFunction AndXor Binary GrayCode NineComplement bool() ToAndXor ToNotFunction ToPOS ToROBDD Dimacs LeastSignificantDigit One Print To2LayerAndXor SAT Sequential ShortestInputsForTransition InputVariables Backwardly BestVariableOrder Fast Canonical SimpleInner TruthTable CreateDummyLogicFunction var() XORP Zero
The website is simply translated by using the Google Translate. Please inform us if you find the wrong/funny/weird translation.