Solving Over-Constrained Problems with SAT Technology.
Josep ArgelichFelip ManyàPublished in: SAT (2005)
Keyphrases
- case study
- stochastic local search
- sat solving
- np complete problems
- boolean optimization
- boolean satisfiability
- cost effective
- neural network
- combinatorial optimization
- satisfiability problem
- rapid development
- sat problem
- data processing
- phase transition
- sat solvers
- exact solution
- sat instances
- computer systems
- search algorithm