Bose-Einstein condensation in satisfiability problems.
Claudio AngioneAnnalisa OcchipintiGiovanni StracquadanioGiuseppe NicosiaPublished in: Eur. J. Oper. Res. (2013)
Keyphrases
- satisfiability problem
- np complete
- temporal logic
- search algorithm
- particle filter
- phase transition
- pspace complete
- sat problem
- solving hard
- stochastic local search
- random sat
- stochastic local search algorithms
- max sat
- model checking
- sat instances
- computational complexity
- upper bound
- knowledge representation
- np hard
- multi agent
- knowledge base