A Computing Procedure for Quantification Theory
Journal of the ACM (JACM)
Backbones and backdoors in satisfiability
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 3
The 3rd international planning competition: results and analysis
Journal of Artificial Intelligence Research
Unifying SAT-based and graph-based planning
IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
Backdoors to typical case complexity
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
On Computing Backbones of Propositional Theories
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Finding small backdoors in SAT instances
Canadian AI'11 Proceedings of the 24th Canadian conference on Advances in artificial intelligence
Reasoning over biological networks using maximum satisfiability
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
| Hi-index | 0.00 |
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 structuredproblems. 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.