Computing in the fractal cloud: modular generic solvers for SAT and Q-SAT variants
Denys DuchierJérôme Durand-LoseMaxime SenotPublished in: CoRR (2011)
Keyphrases
- sat solvers
- sat solving
- sat instances
- sat problem
- satisfiability problem
- modulo theories
- propositional satisfiability
- boolean satisfiability
- sat encodings
- backtracking search
- orders of magnitude
- max sat
- constraint satisfaction
- search strategies
- answer set programming
- fractal dimension
- stochastic local search algorithms
- clause learning
- search algorithm
- maximum satisfiability
- search space
- search procedures
- cloud computing
- search tree
- np complete
- solving hard
- industrial applications