Solving the 3-Satisfiability Problem Using Network-Based Biocomputation.
Jingyuan ZhuAseem SalhotraChristoph Robert MeineckePradheebha SurendiranRoman LyttletonDanny ReuterHillel KuglerStefan DiezAlf MånssonHeiner LinkeTill KortenPublished in: Adv. Intell. Syst. (2022)
Keyphrases
- satisfiability problem
- solving hard
- stochastic local search
- sat instances
- np complete
- temporal logic
- weighted max sat
- phase transition
- search algorithm
- finite domain
- sat problem
- graph coloring problems
- max sat
- davis putnam logemann loveland
- systematic search algorithms
- stochastic local search algorithms
- pspace complete
- random sat
- decision procedures
- combinatorial optimization
- model checking
- combinatorial problems
- propositional satisfiability
- randomly generated
- metaheuristic
- constraint satisfaction problems
- query processing