Backdoors into Heterogeneous Classes of SAT and CSP.
Serge GaspersNeeldhara MisraSebastian OrdyniakStefan SzeiderStanislav ZivnýPublished in: CoRR (2015)
Keyphrases
- satisfiability problem
- sat solvers
- sat problem
- sat instances
- constraint satisfaction problems
- tractable classes
- sat encodings
- np complete
- constraint satisfaction
- phase transition
- backtracking search
- random instances
- boolean satisfiability
- search strategies
- sat solving
- max sat
- constraint propagation
- stochastic local search
- propositional satisfiability
- orders of magnitude
- hidden structure
- search algorithm
- path consistency
- decomposition methods
- clause learning
- constraint programming
- combinatorial problems
- arc consistency
- davis putnam
- unit propagation