XSAT and NAE-SAT of linear CNF classes.
Stefan PorschenTatjana SchmidtEwald SpeckenmeyerAndreas WotzlawPublished in: Discret. Appl. Math. (2014)
Keyphrases
- sat solvers
- sat solving
- sat problem
- propositional satisfiability
- boolean formula
- model counting
- satisfiability problem
- stochastic local search
- sat instances
- orders of magnitude
- search algorithm
- linear model
- boolean satisfiability
- conjunctive normal form
- max sat
- linear constraints
- stochastic local search algorithms
- search space