Tradeoffs in the complexity of backdoor detection

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4741 LNCS, Issue , 2007, Pages 256-270

  Dilkina, Bistra ^a   Gomes, Carla P ^a   Sabharwal, Ashish ^a  

^a Department of Computer Science and School of Operations Research and Information Engineering   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL MATHEMATICS; POLYNOMIALS; PROBLEM SOLVING;

BACKDOOR DETECTION; CLAUSE DETECTION; POLYNOMIAL TIME CONSTRAINT;

COMPUTATIONAL COMPLEXITY;

EID: 38149099245     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-74970-7_20     Document Type: Conference Paper

References (26)

1. Brockington, M., Culberson, J.C.: Camouflaging independent sets in quasi-random graphs. In: Johnson, D.S., Trick, M.A. (eds.) Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, American Mathematical Society, vol. 26, pp. 75-88 (1996)
2. Chandru, V., Hooker, J.N.: Detecting embedded Horn structure in propositional logic. Information Processing Letters 42(2), 109-111 (1992)
3. Chen, H., Dalmau, V.: Beyond hypertree width: Decomposition methods without decompositions. In: van Beek, P. (ed.) CP 2005. LNCS, vol. 3709, pp. 167-181. Springer, Heidelberg (2005)
4. Chen, H., Gomes, C., Selman, B.: Formal models of heavy-tailed behavior in combinatorial search. In: Walsh, T. (ed.) CP 2001. LNCS, vol. 2239, Springer, Heidelberg (2001)
5. Dechter, R.: Constraint Processing. Morgan Kaufmann Publishers Inc., San Francisco (2003)
6. Dechter, R., Pearl, J.: Network-based heuristics for constraint- satisfaction problems. Artif. Intell. 34(1), 1-38 (1987)
7. Deville, Y., Van Hentenryck, P.: An efficient arc consistency algorithm for a class of csp problems. In: IJCAF91, pp. 325-330 (1991)
8. Freuder, E.C.: A sufficient condition for backtrack-free search. J. ACM 29(1), 24-32 (1982)
9. Freuder, E.C.: A sufficient condition for backtrack-bounded search. J. ACM 32(4), 755-761 (1985)
10. Freuder, E.C.: Complexity of k-tree structured constraint satisfaction problems. In: AAAP90, Boston, MA, pp. 4-9 (1990)
11. Gomes, C., Selman, B., Kautz, H.: Boosting Combinatorial Search Through Randomization. In: AAAI'98, New Providence, RI, pp. 431-438 (1998)
12. Gomes, C.P., Selman, B., Crato, N., Kautz, H.: Heavy-tailed phenomena in satisfiability and constraint satisfaction problems. J. Autom. Reason. 24(1-2), 67-100 (2000)
13. Hoffmann, J., Gomes, C., Selman, B.: Structure and problem hardness: Goal asymmetry and DPLL proofs in SAT-based planning. Logical Methods in Computer Science 3(1:6) (2007)
14. ILOG, SA.: CPLEX 10.1 Reference Manual (2006)
15. Kilby, P., Slaney, J.K., Thiébaux, S., Walsh, T.: Backbones and backdoors in satisfiability. In: AAAI'05, pp. 1368-1373 (2005)
16. Li, C.M., Anbulagan: Heuristics based on unit propagation for satisfiability problems. In: IJCAI'97, pp. 366-371 (1997)
17. Lynce, I., Marques-Silva, J.: Hidden structure in unsatisfiable random 3-SAT: An empirical study. In: ICTAI'04 (2004)
18. Moskewicz, M.W., Madigan, C.F., Zhao, Y., Zhang, L., Malik, S.: Chaff: engineering an efficient SAT solver. In: DAC'01, pp. 530-535 (2001) ISBN 1-58113-297-2.
19. Nishimura, N., Ragde, P., Szeider, S.: Detecting backdoor sets with respect to Horn and binary clauses. In: Hoos, H.H., Mitchell, D.G. (eds.) SAT 2004. LNCS, vol. 3542. Springer, Heidelberg (2005)
20. Paris, L., Ostrowski, R., Siegel, P., Sais, L.: Computing Horn strong backdoor sets thanks to local search. In: ICTAP06, pp. 139-143 (2006), http://.ieeecomputersociety.org/10.1109/ICTAI.2006.43 ISSN 1082-3409
21. Samer, M., Szeider, S.: Constraint satisfaction with bounded treewidth revisited. In: Benhamou, F. (ed.) CP 2006. LNCS, vol. 4204, pp. 499-513. Springer, Heidelberg (2006)
22. Sinz, C., Kaiser, A., Kiichlin, W.: Formal methods for the validation of automotive product configuration data. Artificial Intelligence for Engr. Design, Analysis and Manufacturing 17(1), 75-97 (2003)
23. Szeider, S.: Backdoor sets for DLL subsolvers. J. of Automated Reasoning (2005)
24. van Beek, P., Dechter, R.: On the minimality and global consistency of row-convex constraint networks. J. ACM 42(3), 543-561 (1995)
25. Williams, R., Gomes, C., Selman, B.: Backdoors to typical case complexity. In: IJCAI'03, pp. 1173-1178 (2003)
26. Williams, R., Gomes, C., Selman, B.: On the connections between heavy-tails, backdoors, and restarts in combinatorial search. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol. 2919, pp. 222-230. Springer, Heidelberg (2004)