How Easy it is to Know How: An Upper Bound for the Satisfiability Problem.
Carlos ArecesValentin CassanoPablo F. CastroRaul FervariAndrés R. SaraviaPublished in: JELIA (2023)
Keyphrases
- satisfiability problem
- upper bound
- lower bound
- np complete
- temporal logic
- search algorithm
- sat problem
- phase transition
- stochastic local search algorithms
- pspace complete
- worst case
- solving hard
- branch and bound
- max sat
- decision procedures
- branch and bound algorithm
- sat instances
- optimal solution
- objective function
- stochastic local search
- finite domain
- database