Why MCSP Is a More Important Problem Than SAT (Invited Talk).
Rahul SanthanamPublished in: FSTTCS (2022)
Keyphrases
- invited talk
- sat solvers
- sat problem
- satisfiability problem
- knowledge discovery and data mining
- selected papers
- search algorithm
- boolean satisfiability
- stochastic local search
- phase transition
- max sat
- stochastic local search algorithms
- sat solving
- propositional satisfiability
- search strategies
- sat encodings
- artificial intelligence
- machine learning
- sat instances
- program committee