Backdoor trees

Proceedings of the National Conference on Artificial Intelligence

Volumn 1, Issue , 2008, Pages 363-368

  Samer, Marko ^a   Szeider, Stefan ^a  

^a DURHAM UNIVERSITY   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; BIONICS; COMPUTATIONAL COMPLEXITY;

EMPIRICAL RESULTS; HIDDEN STRUCTURES; SAT INSTANCES; SATISFIABILITY; VARIOUS DENSITIES;

PACKET NETWORKS;

EID: 57749197156     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (23)

1. Chen, J.; and Kanj, I. A. 2005. On approximating minimum vertex cover for graphs with perfect matching. Theoret. Comput. Sci. 337(1-3):305-318.
2. Crama, Y.; Ekin, O.; and Hammer, P. L. 1997. Variable and term removal from Boolean formulae. Discr. Appl. Math. 75(3):217-230.
3. Dilkina, B. N.; Gomes, C. P.; and Sabharwal, A. 2007. Tradeoffs in the complexity of backdoor detection. In Proc. CP'07, LNCS 4741, 256-270. Springer-Verlag.
4. Downey, R. G.; and Fellows, M. R. 1999. Parameterized Complexity. Springer-Verlag.
5. Flum, J.; and Grohe, M. 2006. Parameterized Complexity Theory. Springer-Verlag.
6. Gottlob, G.; Pichler, R.; and Wei, F. 2006. Bounded treewidth as a key to tractability of knowledge representation and reasoning. In Proc. AAAI'06, 250-256. AAAI Press.
7. Gottlob, G.; and Szeider, S. 2006. Fixed-parameter algorithms for artificial intelligence, constraint satisfaction, and database problems. The Computer Journal. doi: 10.1093/comjnl/bxm056.
8. Impagliazzo, R.; Paturi, R.; and Zane, F. 2001. Which problems have strongly exponential complexity. J. of Computer and System Sciences 63(4):512-530.
9. Interian, Y. 2003. Backdoor sets for random 3-SAT. In Proc. SAT'03, 231-238. Informal Proc.
10. Kilby, P.; Slaney, J. K.; Thiébaux, S.; and Walsh, T. 2005. Backbones and backdoors in satisfiability. In Proc. AAAI'05, 1368-1373. AAAI Press.
11. Lynce, I.; and Marques-Silva, J. P. 2004. Hidden structure in unsatisfiable random 3-SAT: An empirical study. In Proc. ICTAI'04, 246-251. IEEE Computer Society.
12. Niedermeier, R. 2006. Invitation to Fixed-Parameter Algorithms. Oxford Univ. Press.
13. Nishimura, N.; Ragde, P.; and Szeider, S. 2004. Detecting backdoor sets with respect to Horn and binary clauses. In Proc. SAT'04, 96-103. Informal Proc.
14. Nishimura, N.; Ragde, P.; and Szeider, S. 2007. Solving #SAT using vertex covers. Acta Informatica 44(7-8):509-523.
15. Razgon, I.; and O'Sullivan, B. 2008. Almost 2-SAT is fixed-parameter tractable. arXiv:0801.1300.
16. Ruan, Y.; Kautz, H. A.; and Horvitz, E. 2004. The backdoor key. A path to understanding problem hardness. In Proc. AAAI'04, 124-130. AAAI Press.
17. Samer, M.; and Szeider, S. 2007a. Backdoor sets of quantified Boolean formulas. In Proc. SAT'07, LNCS 4501, 230-243. Springer-Verlag.
18. Samer, M.; and Szeider, S. 2007b. Algorithms for propositional model counting. In Proc. LPAR'07, LNCS 4790, 484-498. Springer-Verlag.
19. Sinz, C.; Kaiser, A.; and Küchlin, W. 2003. Formal methods for the validation of automotive product configuration data. Artificial Intelligence for Engineering Design, Analysis and Manufacturing 17(1):75-97.
20. Szeider, S. 2005. Backdoor sets for DLL subsolvers. J. of Automated Reasoning 35(1-3):73-88.
21. Vazirani, V. V. 2001. Approximation Algorithms. Springer-Verlag.
22. Williams, R.; Gomes, C.; and Selman, B. 2003a. Backdoors to typical case complexity. In Proc. IJCAI'03, 1173-1178. Morgan Kaufmann.
23. Williams, R.; Gomes, C.; and Selman, B. 2003b. On the connections between backdoors, restarts, and heavy-tailedness in combinatorial search. In Proc. SAT'03, 222-230. Informal Proc.