Work by Kilby, Slaney, Thiebaux and Walsh  showed that the backdoors and backbones of unstructured Random 3SAT instances are largely disjoint. In this work we extend this study to the consideration of backdoors in SAT encodings of structured problems. We show that the results of Kilby et al. also apply to structured problems. Further, we analyse the frequency with which individual variables appear in backdoors for specific problem instances. In all problem classes there are variables with particularly high frequencies of backdoor membership. Backbone variables that do appear in backdoors typically appear in very few.
|Number of pages||5|
|Publication status||Published - 2008|
|Event||14th International Conference on Principles and Practice of Constraint Programming - Sydney, Australia|
Duration: 1 Sep 2008 → …
|Conference||14th International Conference on Principles and Practice of Constraint Programming|
|Period||1/09/08 → …|
- weak backdoors
- SAT encodings
- structured problems
Gregory, P., Fox, M., & Long, D. (2008). A new empirical study of weak backdoors. 618-623. Paper presented at 14th International Conference on Principles and Practice of Constraint Programming, Sydney, Australia, .