Solving equations on words through boolean satisfiability.
Michaël LaroucheAlexandre Blondin MasséSébastien GabourySylvain HalléPublished in: SAC (2013)
Keyphrases
- boolean optimization
- boolean satisfiability
- sat solving
- sat solvers
- randomly generated
- branch and bound algorithm
- probabilistic planning
- sat instances
- sat problem
- symmetry breaking
- integer linear programming
- random sat instances
- max sat
- boolean formula
- combinatorial problems
- genetic algorithm
- lower bound
- stochastic local search
- phase transition
- branch and bound
- sat encodings
- constraint satisfaction
- random sat