Homing Sequence Derivation With Quantified Boolean Satisfiability.
Kuan-Hua TuHung-En WangJie-Hong R. JiangNatalia KushikNina YevtushenkoPublished in: IEEE Trans. Computers (2022)
Keyphrases
- boolean satisfiability
- sat solvers
- boolean optimization
- sat problem
- branch and bound algorithm
- probabilistic planning
- randomly generated
- sat solving
- integer linear programming
- symmetry breaking
- max sat
- maximum satisfiability
- heuristic search
- sat instances
- np complete
- markov decision processes
- constraint satisfaction problems
- combinatorial problems
- lower bound
- upper bound