Hot answers tagged

2

Be careful, a polynomial algorithm, that finds a minimal unsatisfiable core of a given CNF ๐น, doesnโ€™t mean that ๐‘ƒ=๐‘๐‘ƒ, because the algorithm could output a Boolean formula ๐บ such that if ๐น is unsatisfiable, ๐บ is a minimal unsatisfiable core of ๐น; if ๐น is satisfiable, ๐บ is a subset of the clauses of ๐น and it is satisfiable. Therefore, the output of ...


Only top voted, non community-wiki answers of a minimum length are eligible