Backdoor sets for DLL subsolvers

Journal of Automated Reasoning

Volumn 35, Issue 1-3, 2005, Pages 73-88

  Szeider, Stefan ^a  

^a DURHAM UNIVERSITY   (United Kingdom)

Author keywords

Backdoor sets; Parameterized complexity; Pure literal elimination; Satisfiability; Unit propagation; W P completeness

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; INTEGER PROGRAMMING; PARAMETER ESTIMATION; PROBLEM SOLVING;

PARAMETERIZED COMPLEXITIES; PURE LITERAL ELIMINATION; SATISFIABILITY; UNIT PROPAGATION;

SET THEORY;

EID: 33749558762     PISSN: 01687433     EISSN: 15730670     Source Type: Journal    
DOI: 10.1007/s10817-005-9007-9     Document Type: Article

References (12)

1. Abrahamson, K. A., Downey, R. G. and Fellows, M. R. (1995) Fixed-parameter tractability and completeness. IV. On completeness for W[P] and PSPACE analogues, Ann, Pure Appl. Logic 73(3), 235-276.
2. Cook, S. A. and Mitchell, D. G. (1997) Finding hard instances of the satisfiability problem: A survey, in Satisfiability problem: theory and applications (Piscataway, NJ, 1996), American Mathematical Society, pp. 1-17.
3. Davis, M., Logemann, G. and Loveland, D. (1962) A machine program for theorem-proving, Commun. ACM 5, 394-397.
4. Davis, M. and Putnam, H. (1960) A computing procedure for quantification theory, J. ACM 7(3), 201-215.
5. Downey, R. G. and Fellows, M. R. (1999) Parameterized Complexity, Monographs in Computer Science. Springer.
6. Flum, J. and Grohe, M. (2004) Parameterized complexity and subexponential time, Bull. Eur. Assoc. Theor. Comput. Sci. 84, 71-100.
7. Interian, Y. (2003) Backdoor sets for random 3-SAT, in Sixth International Conference on Theory and Applications of Satisfiability Testing, S. Margherita Ligure, Portofino, Italy, May 5-8, 2003, (SAT 2003), informal proceedings, pp. 231-238.
8. Malik, S. (1994) Analysis of Cyclic Combinatorial Circuits, IEEE Trans. Comput.-Aided Des. 13(7), 950-956.
9. Nishimura, N., Ragde, P. and Szeider, S. (2004) Detecting backdoor sets with respect to horn and binary clauses, in H. Hoos and D. G. Mitchell (eds.), Seventh International Conference on Theory and Applications of Satisfiability Testing, 10-13 May, 2004, Vancouver, BC, Canada (SAT 2004), informal proceedings, pp. 96-103.
10. Ruan, Y., Kautz, H. A. and Horvitz, E. (2004) The backdoor key: A path to understanding problem hardness, in D. L. McGuinness and G. Ferguson (eds.), Proceedings of the 19th National Conference on Artificial Intelligence, 16th Conference on Innovative Applications of Artificial Intelligence, pp. 124-130.
11. Williams, R., Gomes, C. and Selman, B. (2003a) Backdoors to typical case complexity, in G. Gottlob and T. Walsh (eds.), Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence, IJCAI 2003, pp. 1173-1178.
12. Williams, R., Gomes, C. and Selman, B. (2003b) On the connections between backdoors, restarts, and heavy-tailedness in combinatorial search, in Sixth International Conference on Theory and Applications of Satisfiability Testing, S. Margherita Ligure, Portofino, Italy, May 5-8, 2003 (SAT 2003), informal proceedings, pp. 222-230.