A comparison of encodings for cardinality constraints in a SAT solver.
Ed WynnPublished in: CoRR (2018)
Keyphrases
- sat solvers
- cardinality constraints
- boolean satisfiability
- sat instances
- sat solving
- sat encodings
- orders of magnitude
- sat problem
- constraint satisfaction
- max sat
- search space
- satisfiability problem
- functional dependencies
- probabilistic planning
- randomly generated
- symmetry breaking
- boolean formula
- search strategies
- database
- expressive power
- linear programming
- database schema
- knapsack problem