Approximating Maximum 2-CNF Satisfiability.

David J. Haglin

Published in: Parallel Process. Lett. (1992)

Keyphrases

cnf formula
conjunctive normal form
sat solving
satisfiability problem
np complete
sat problem
sat instances
boolean formula
boolean functions
computational complexity
propositional logic
stochastic local search
decision trees
max sat
propositional satisfiability
sat encodings