Computing in the Fractal Cloud: Modular Generic Solvers for SAT and Q-SAT Variants.
Denys DuchierJérôme Durand-LoseMaxime SenotPublished in: TAMC (2012)
Keyphrases
- sat solvers
- sat solving
- sat instances
- sat problem
- modulo theories
- satisfiability problem
- boolean satisfiability
- sat encodings
- max sat
- backtracking search
- propositional satisfiability
- search algorithm
- stochastic local search
- randomly generated
- stochastic local search algorithms
- phase transition
- image compression
- graph coloring
- orders of magnitude
- heuristic search
- search strategies
- fractal dimension
- texture analysis
- search procedures
- branch and bound
- constraint satisfaction
- answer sets
- search problems
- constraint satisfaction problems
- cloud computing
- quantified boolean formulas
- np hard
- search space