Boolean Gröbner bases in SAT solving.

Christoph Zengler Wolfgang Küchlin

Published in: ACM Commun. Comput. Algebra (2011)

Keyphrases

sat solving
numerically stable
sat solvers
polynomial equations
boolean satisfiability
boolean functions
numerical stability
sat problem
boolean formula
sat encodings
boolean optimization
orders of magnitude
randomly generated
symmetry breaking
learning algorithm
max sat
search space
clause learning
tabu search