Solving SAT by an Iterative Version of the Inclusion-Exclusion Principle.

Gábor Kusper Csaba Biró

Published in: SYNASC (2015)

Keyphrases

stochastic local search
sat solving
np complete problems
search algorithm
sat solvers
sat instances
boolean optimization
constraint satisfaction problems
variable ordering
data sets
search strategies
boolean satisfiability
sat encodings
solving hard