Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Kilby, P., Slaney, J., Thiebaux, S., Walsh, T.: Backbones and backdoors in satisfiability. In: Proceedings of AAAI 2005 (2005)
Williams, R., Gomes, C., Selman, B.: Backdoors to typical case complexity. In: IJCAI 2003 (2003)
Davis, M., Putnam, H.: A computing procedure for quantification theory. Journal of the ACM 7(3), 201–215 (1960)
Long, D., Fox, M.: The 3rd IPC: Results and analysis. JAIR 20, 1–59 (2003)
Bacchus, F.: The AIPS 2000 Planning Competition. AI Magazine 22(3), 47–56 (2001)
Kautz, H.A., Selman, B.: Unifying SAT-based and graph-based planning. In: IJCAI, pp. 318–332 (1999)
Hoos, H.H., Stützle, T.: SATLIB: An Online Resource for Research on SAT. In: Gent, I., van Maaren, H., Walsh, T. (eds.) SAT2000: Highlights of Satisfiability Research in the year 2000. Frontiers in Artificial Intelligence and Applications, pp. 283–292. Kluwer Academic, Dordrecht (2000)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gregory, P., Fox, M., Long, D. (2008). A New Empirical Study of Weak Backdoors. In: Stuckey, P.J. (eds) Principles and Practice of Constraint Programming. CP 2008. Lecture Notes in Computer Science, vol 5202. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85958-1_53
Download citation
DOI: https://doi.org/10.1007/978-3-540-85958-1_53
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-85957-4
Online ISBN: 978-3-540-85958-1
eBook Packages: Computer ScienceComputer Science (R0)