Solving #SAT and MAXSAT by Dynamic Programming.
Sigve Hortemo SætherJan Arne TelleMartin VatshellePublished in: J. Artif. Intell. Res. (2015)
Keyphrases
- dynamic programming
- sat solvers
- boolean satisfiability
- boolean optimization
- sat problem
- sat solving
- combinatorial optimization
- sat instances
- weighted max sat
- stochastic local search
- np complete problems
- solving hard
- sat encodings
- dynamic programming algorithms
- satisfiability problem
- max sat
- maximum satisfiability
- branch and bound algorithm
- upper bound
- state space
- variable ordering
- orders of magnitude
- pseudo boolean
- markov decision problems
- boolean formula
- propositional satisfiability
- lagrangian relaxation
- phase transition
- optimal policy
- solving problems
- combinatorial problems
- reinforcement learning
- probabilistic planning
- optimal control
- single machine
- search strategies
- greedy algorithm
- markov decision processes
- dp matching