Comparative studies of constraint satisfaction and Davis-Putnam algorithms for maximum satisfiabilitv problems.
Richard J. WallaceEugene C. FreuderPublished in: Cliques, Coloring, and Satisfiability (1993)
Keyphrases
- constraint satisfaction
- comparative study
- combinatorial problems
- constrained problems
- davis putnam
- constraint problems
- propositional satisfiability
- constraint satisfaction problems
- russian doll search
- constraint programming
- optimization problems
- constraint optimization
- constraint relaxation
- practical problems
- propositional logic
- soft constraints
- benchmark problems
- phase transition
- constraint propagation
- search methods
- computational complexity
- learning algorithm
- sat solvers
- search algorithm
- orders of magnitude
- search strategies
- heuristic search
- expert systems
- satisfiability problem
- search space
- np complete
- metaheuristic
- max sat
- sat problem
- combinatorial optimization
- arc consistency
- genetic algorithm