Combining finite learning automata with GSAT for the satisfiability problem.
Noureddine BouhmalaOle-Christoffer GranmoPublished in: Eng. Appl. Artif. Intell. (2010)
Keyphrases
- satisfiability problem
- learning automata
- np complete
- temporal logic
- search algorithm
- pursuit algorithm
- phase transition
- sat problem
- stochastic local search
- stochastic local search algorithms
- guarded fragment
- learning automaton
- davis putnam
- reinforcement learning
- genetic algorithm
- sat instances
- max sat
- decision procedures
- graph coloring problems
- mazurkiewicz traces
- constraint satisfaction
- evolutionary algorithm
- knowledge base