Computation of renameable horn backdoors

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

Volumn 4996 LNCS, Issue , 2008, Pages 154-160

  Kottler, Stephan ^a   Kaufmann, Michael ^a   Sinz, Carsten ^a  

^a UNIVERSITY OF TÜBINGEN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; GRAPH THEORY; PROBLEM SOLVING; SET THEORY;

BACKDOOR SET; REAL-WORLD INSTANCES; SAT INSTANCES;

COMPUTATION THEORY;

EID: 44649095335     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-79719-7_15     Document Type: Conference Paper

References (20)

1. Dimacs, ftp://dimacs.rutgers.edu/pub/challenge/satisfiability/benchmarks/
2. The international SAT competition (2002-2007), http://www.satcompetition. org
3. Aspvall, B., Plass, M.F., Tarjan, R.E.: A linear-time algorithm for testing the truth of certain quantified boolean formulas. Inf. Proc. Lett. 8, 121-123 (1979)
4. Buresh-Oppenheim, J., Mitchell, D.G.: Minimum witnesses for unsatisfiable 2CNFs. In: Biere, A., Gomes, C.P. (eds.) SAT 2006. LNCS, vol. 4121, Springer, Heidelberg (2006)
5. Chen, J., Liu, Y., Lu, S.: Directed feedback vertex set problem is fpt. In Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs (2007)
6. Davis, M., Logemann, G., Loveland, D.: A machine program for theorem-proving. Commun. ACM 5(7), 394-397 (1962)
7. Davis, M., Putnam, H.: A computing procedure for quantification theory. J. ACM 7(3), 201-215 (1960)
8. Demetrescu, C., Finocchi, I.: Combinatorial algorithms for feedback problems in directed graphs. Inf. Process. Lett. 86(3), 129-136 (2003)
9. Dilkina, B., Gomes, C.P., Sabharwal, A.: Tradeoffs in the complexity of backdoor detection. In: Bessiè re, C. (ed.) CP 2007. LNCS, vol. 4741, Springer, Heidelberg (2007)
10. Interian, Y.: Backdoor sets for random 3-sat. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol. 2919, Springer, Heidelberg (2004)
11. Lewis, H.R.: Renaming a set of clauses as a horn set. J. ACM 25, 134-135 (1978)
12. Nishimura, N., Ragde, P., Szeider, S.: Detecting backdoor sets with respect to Horn and Binary clauses. In: H. Hoos, H., Mitchell, D.G. (eds.) SAT 2004. LNCS, vol. 3542, Springer, Heidelberg (2005)
13. Nishimura, N., Ragde, P., Szeider, S.: Solving #SAT using vertex covers. Acta Informatica 44(7-8), 509-523 (2007)
14. Papadimitriou, C.H.: Computational Complexity. Addison-Wesley, Reading (1994)
15. Paris, L., Ostrowski, R., Siegel, P., Sais, L.: Computing horn strong backdoor sets thanks to local search. In: ICTAI 2006, IEEE Computer Society, Los Alamitos (2006)
16. Ruan, Y., Kautz, H.A., Horvitz, E.: The backdoor key: A path to understanding problem hardness. In: AAAI, pp. 124-130 (2004)
17. Sinz, C.: SAT benchmarks (2003), http://www-sr.informatik.uni-tuebingen. de/∼sinz/DC
18. Szeider, S.: Backdoor sets for dll subsolvers. J. Autom. Reasoning 35, 73-88 (2005)
19. Szeider, S.: Matched formulas and backdoor sets. In: Marques-Silva, J., Sakallah, K.A. (eds.) SAT 2007. LNCS, vol. 4501, Springer, Heidelberg (2007)
20. Williams, R., Gomes, C., Selman, B.: Backdoors to typical case complexity. In: IJCAI (2003)