Modeling and Solving Semiring Constraint Satisfaction Problems by Transformation to Weighted Semiring Max-SAT.
Louise Leenen AnbulaganThomas MeyerAditya K. GhosePublished in: Australian Conference on Artificial Intelligence (2007)
Keyphrases
- max sat
- constraint satisfaction problems
- sat problem
- constraint satisfaction
- graph coloring
- finding optimal solutions
- weighted max sat
- constraint problems
- stochastic local search
- sat solvers
- variable ordering
- max sat solver
- sat instances
- lower bound
- satisfiability problem
- branch and bound algorithm
- search space
- dynamic constraint satisfaction problems
- constraint propagation
- search algorithm
- np complete
- tabu search
- np hard
- partial constraint satisfaction
- boolean satisfiability
- soft constraints
- combinatorial problems
- constraint programming
- branch and bound
- solving constraint satisfaction problems
- propositional satisfiability
- randomly generated
- upper bound
- linear programming
- arc consistency
- phase transition
- configuration problems
- constraint solvers
- heuristic search
- computational complexity
- objective function
- davis putnam
- global constraints
- integer programming