Another Way to Browse the Search Space For Some Transformations from CSP to SAT.
Richard OstrowskiLionel ParisAdrien VaretPublished in: ISAIM (2020)
Keyphrases
- search space
- constraint satisfaction problems
- sat problem
- sat solvers
- sat encodings
- backtracking search
- search algorithm
- constraint satisfaction
- constraint propagation
- propositional satisfiability
- clause learning
- phase transition
- tractable classes
- heuristic search
- boolean satisfiability
- branch and bound
- sat instances
- sat solving
- combinatorial problems
- search tree
- unit propagation
- metaheuristic
- search procedures
- max sat
- constraint programming
- optimal solution
- graph coloring
- random instances
- search strategy
- constraint networks
- satisfiability problem
- orders of magnitude
- np hard
- search problems
- reduce the search space
- arc consistency
- search procedure
- decomposition methods
- global optimum
- effective pruning
- np complete problems
- constraint solving
- search strategies
- fitness function
- forward checking
- global constraints
- stochastic local search algorithms
- np complete
- state space
- genetic algorithm