Solving the Satisfiability Problem Using Finite Learning Automata.
Ole-Christoffer GranmoNoureddine BouhmalaPublished in: Int. J. Comput. Sci. Appl. (2007)
Keyphrases
- satisfiability problem
- learning automata
- solving hard
- stochastic local search
- np complete
- sat instances
- search algorithm
- temporal logic
- phase transition
- pursuit algorithm
- weighted max sat
- finite domain
- reinforcement learning
- learning automaton
- graph coloring problems
- systematic search algorithms
- sat problem
- genetic algorithm
- davis putnam logemann loveland
- pspace complete
- max sat
- model checking
- random sat
- guarded fragment
- np hard
- decision procedures
- combinatorial optimization
- constraint satisfaction problems
- stochastic local search algorithms