Some Results on Random Mixed SAT Problems.
Andreas Basse-O'ConnorTobias Lindhardt OvergaardMette SkjøttPublished in: CoRR (2023)
Keyphrases
- sat problem
- randomly generated
- satisfiability problem
- constraint satisfaction problems
- np complete
- phase transition
- sat solvers
- boolean satisfiability
- random sat instances
- sat instances
- random sat
- sat solving
- branch and bound
- decision problems
- max sat
- stochastic local search
- np complete problems
- truth assignment
- temporal logic
- davis putnam
- propositional satisfiability
- learning algorithm
- maximum satisfiability
- search space
- constraint satisfaction
- branch and bound algorithm