Testing satisfiability of CNF formulas by computing a stable set of points.

Eugene Goldberg

Published in: Ann. Math. Artif. Intell. (2005)

Keyphrases

stable set
cnf formula
np complete
max sat
sat problem
knowledge compilation
conjunctive normal form
propositional formulas
davis putnam
satisfiability problem
phase transition
randomly generated
natural language
search strategy
search space
boolean formula
computational complexity