Boolean Formula Satisfiability - Solving with Minimum Amount of Variables Set to True -
i having trouble coming pseudocode solve boolean satisfiability problem using minimum amount of variables set true.
i have method satisfiable number(h) can call obtain minimum number of variables needed set true in order boolean formula satisfiable.
find-sat-min(f) { if (not sat(f)) return 0 l = {x | x variable in f}; s = {}; int truecount = 0; (x in l) { if (sat(f ^ x) && truecount < satisfiable number(f)) { s = s u {x}; f = f ^ x; truecount++; } else { s = s u {not x}; f = f ^ not x; } } return s;
}
here's current logic. please let me know if i'm on right track.
Comments
Post a Comment