On the stability of Lagrange programming neural networks for satisfiability problems of propositional calculus.
Masahiro NagamatuTorao YanaruPublished in: Neurocomputing (1996)
Keyphrases
- satisfiability problem
- propositional calculus
- neural network
- np complete
- search algorithm
- temporal logic
- phase transition
- programming language
- stochastic local search algorithms
- solving hard
- sat instances
- stochastic local search
- sat problem
- pspace complete
- max sat
- davis putnam
- graph coloring problems
- evolutionary algorithm
- cellular automata
- learning algorithm
- genetic algorithm