A Short Implicant of a CNF Formula with Many Satisfying Assignments.

Daniel Kane Osamu Watanabe

Published in: Algorithmica (2016)

Keyphrases

cnf formula
np complete
max sat
knowledge compilation
conjunctive normal form
database
information retrieval
lower bound
sat problem
genetic algorithm
upper bound
simulated annealing