Testing Satisfiability of CNF Formulas by Computing a Stable Set of Points.

Eugene Goldberg

Published in: CADE (2002)

Keyphrases

stable set
cnf formula
np complete
max sat
conjunctive normal form
sat problem
knowledge compilation
davis putnam
satisfiability problem
np hard
constraint satisfaction problems
randomly generated
sat solvers
boolean formula
knowledge base
language model
special case
data structure
reinforcement learning