Regular-SAT: A many-valued approach to solving combinatorial problems.
Ramón BéjarFelip ManyàAlba CabiscolCèsar FernándezCarla P. GomesPublished in: Discret. Appl. Math. (2007)
Keyphrases
- combinatorial problems
- solving hard
- graph coloring
- pseudo boolean
- sat encodings
- constraint programming
- combinatorial optimization
- phase transition
- constraint satisfaction problems
- traveling salesman problem
- metaheuristic
- constraint satisfaction
- branch and bound algorithm
- satisfiability problem
- stochastic local search
- boolean satisfiability
- combinatorial search
- propositional logic
- search problems
- global constraints
- sat problem
- propositional satisfiability
- constraint propagation
- variable ordering
- tabu search
- max sat
- maximum satisfiability
- constraint solvers
- evolutionary algorithm
- graph colouring
- solving problems
- sat solvers
- integer programming
- modal logic
- branch and bound
- ant colony optimization
- optimization problems