Applying Modern SAT-solvers to Solving Hard Problems.
Artur NiewiadomskiPiotr SwitalskiTeofil SidorukWojciech PenczekPublished in: Fundam. Informaticae (2019)
Keyphrases
- propositional satisfiability
- solving hard
- sat solvers
- sat problem
- sat instances
- sat solving
- satisfiability problem
- propositional logic
- search problems
- backtrack search
- orders of magnitude
- combinatorial problems
- automated reasoning
- weighted max sat
- max sat
- np complete
- search tree
- search strategies
- heuristic search
- cellular automata
- tabu search
- simulated annealing
- dynamic programming
- search space