Unsatisfiable CNF Formulas contain Many Conflicts.

Dominik Scheder

Published in: ISAAC (2013)

Keyphrases

cnf formula
np complete
max sat
sat problem
conjunctive normal form
knowledge compilation
propositional formulas
genetic algorithm
lower bound
sat solvers
randomly generated