Solving the Satisfiability Problem Through Boolean Networks
Andrea RoliMichela MilanoPublished in: CoRR (2011)
Keyphrases
- satisfiability problem
- boolean networks
- stochastic local search
- sat instances
- np complete
- weighted max sat
- temporal logic
- phase transition
- search algorithm
- sat problem
- davis putnam logemann loveland
- stochastic local search algorithms
- biological systems
- gene regulatory networks
- max sat
- logic programs
- complex systems
- high dimensional
- data analysis
- artificial intelligence
- databases