Simulated Annealing Artificial Neural Networks for the Satisfiability (SAT) Problem.
Tatiana TambouratzisPublished in: ICANNGA (1995)
Keyphrases
- sat problem
- artificial neural networks
- simulated annealing
- satisfiability problem
- genetic algorithm
- genetic algorithm ga
- phase transition
- np complete
- sat solvers
- constraint satisfaction problems
- randomly generated
- sat solving
- tabu search
- metaheuristic
- neural network
- boolean satisfiability
- sat instances
- max sat
- davis putnam
- propositional satisfiability
- random sat
- evolutionary algorithm
- random sat instances
- hill climbing
- combinatorial optimization
- branch and bound
- decision problems
- stochastic local search
- constraint satisfaction
- temporal logic
- cnf formula
- orders of magnitude
- boolean formula
- dynamic programming
- search space
- graph coloring
- computational complexity
- search algorithm