Computing Binary Combinatorial Gray Codes Via Exhaustive Search With SAT Solvers.
Igor ZinovikDaniel KroeningYury ChebiryakPublished in: IEEE Trans. Inf. Theory (2008)
Keyphrases
- exhaustive search
- sat solvers
- search space
- sat solving
- propositional satisfiability
- orders of magnitude
- computational complexity
- solution space
- max sat
- dynamic programming
- constraint satisfaction
- sat instances
- search methods
- sat problem
- search tree
- search strategies
- weighted max sat
- boolean satisfiability
- simulated annealing
- lower bound
- sat encodings
- clause learning sat solvers
- genetic algorithm
- branch and bound
- logic programs
- clause learning
- evolutionary algorithm
- search algorithm
- optimal solution
- neural network