How Easy it is to Know How: An Upper Bound for the Satisfiability Problem.
Carlos ArecesValentin CassanoRaul FervariPablo F. CastroAndrés R. SaraviaPublished in: CoRR (2023)
Keyphrases
- satisfiability problem
- upper bound
- np complete
- lower bound
- temporal logic
- search algorithm
- phase transition
- sat problem
- stochastic local search algorithms
- sat instances
- solving hard
- stochastic local search
- branch and bound algorithm
- worst case
- pspace complete
- max sat
- model checking
- clause learning
- decision procedures
- mazurkiewicz traces
- branch and bound