Solving the SAT problem with the string multiset rewriting calculus.
Péter BattyányiPublished in: Computing (2024)
Keyphrases
- sat problem
- np complete problems
- sat instances
- weighted max sat
- sat solving
- solving hard
- stochastic local search
- random sat instances
- satisfiability problem
- np complete
- max sat
- phase transition
- constraint satisfaction problems
- sat solvers
- randomly generated
- boolean satisfiability
- data structure
- propositional satisfiability
- random sat
- combinatorial problems
- graph coloring
- np hard
- constraint programming
- combinatorial optimization
- sat encodings
- metaheuristic
- scheduling problem
- search space
- search algorithm