Backdoors into Heterogeneous Classes of SAT and CSP.
Serge GaspersNeeldhara MisraSebastian OrdyniakStefan SzeiderStanislav ZivnýPublished in: AAAI (2014)
Keyphrases
- satisfiability problem
- sat solvers
- sat problem
- sat instances
- constraint satisfaction problems
- tractable classes
- sat encodings
- np complete
- backtracking search
- orders of magnitude
- constraint satisfaction
- unit propagation
- constraint propagation
- search algorithm
- random instances
- clause learning
- search space
- decomposition methods
- computational properties
- search tree
- propositional satisfiability
- boolean formula
- boolean satisfiability
- max sat
- arc consistency
- stochastic local search algorithms
- constraint programming
- special case