Gregory, Peter, Fox, Maria and Long, Derek (2008) A New Empirical Study of Weak Backdoors. In: Principles and Practice of Constraint Programming, 14th International Conference, CP 2008, Sydney, Australia, September 14-18, 2008. Proceedings 2008. Lecture Notes in Computer Science, 5202 . Springer Berlin Heidelberg, Berlin, Heidelberg, pp. 618-623. ISBN 978-3-540-85957-4

Work by Kilby, Slaney, Thiebaux and Walsh [1] 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.

Add to AnyAdd to TwitterAdd to FacebookAdd to LinkedinAdd to PinterestAdd to Email