Uniform solutions to SAT and 3-SAT by spiking neural P systems with pre-computed resources.
Tseren-Onolt IshdorjAlberto LeporatiPublished in: Nat. Comput. (2008)
Keyphrases
- pre computed
- search algorithm
- satisfiability problem
- stochastic local search algorithms
- bio inspired
- search strategies
- sat solvers
- sat problem
- disk space
- boolean satisfiability
- spike trains
- search procedures
- network architecture
- phase transition
- neural network
- propositional satisfiability
- databases
- hebbian learning
- spiking neurons
- data sets
- database