Backbones and backdoors in satisfiability

Proceedings of the National Conference on Artificial Intelligence

Volumn 3, Issue , 2005, Pages 1368-1373

  Kilby, Philip ^a   Slaney, John ^a   Thiébaux, Sylvie ^a   Walsh, Toby ^b  

^a AUSTRALIAN NATIONAL UNIVERSITY   (Australia)

^b UNIVERSITY OF NEW SOUTH WALES   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; CORRELATION METHODS; PROBLEM SOLVING;

BACKBONES; BACKDOORS; DAVIS PUTNAM PROCEDURE;

ARTIFICIAL INTELLIGENCE;

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

References (13)

1. Achlioptas, D.; Gomes, C.; Kautz, H.; and Selman, B. 2000. Generating satisfiable problem instances. In Proc. of 17th Nat. Conf. on AI.
2. Beacham, A. 2000. The complexity of problems without backbones. Master's thesis, Dept. of Computing Science, University of Alberta.
3. Cook, S. 1971. The complexity of theorem proving procedures. In Proc. 3rd Annual ACM Symposium on the Theory of Computation, 151-158.
4. Garey, M., and Johnson, D. 1979. Computers and intractability: a guide to the theory of NP-completeness. W.H. Freeman.
5. Li, C. M. 1999. A constrained-based approach to narrow search trees for satisfiability. Information processing letters 71:75-80.
6. Monasson, R.; Zecchina, R.; Kirkpatrick, S.; Selman, B.; and Troyansky, L. 1998. Determining computational complexity for characteristic 'phase transitions'. Nature 400:133-137.
7. Nishimura, N.; Ragde, P.; and Szeider, S. 2004. Detecting backdoor sets with respect to horn and binary clauses. In Proc. of 7th Int. Conf. on Theory and Applications of Satisfiability Testing.
8. Parkes, A. 1997. Clustering at the phase transition. In Proc. of the 14th Nat. Conf. on AI, 340-345.
9. Ruan, Y.; Kautz, H.; and Horvitz, E. 2004. The backdoor key: A path to understanding problem hardness. In Proc. of the 19th Nat. Conf. on AI.
10. Slaney, J., and Walsh, T. 2001. Backbones in optimization and approximation. In Proc. of 17th IJCAI.
11. Williams, R.; Gomes, C.; and Selman, B. 2003. Backdoors to typical case complexity. In Proc. of the 18th IJCAI.
12. Zhang, W. 2001. Phase transitions and backbones of 3-SAT and Maximum 3-SAT. In Proc. of 7th Int. Conf. on Principles and Practice of Constraint Programming (CP2001). Springer.
13. Zhang, W. 2004. Configuration landscape analysis and backbone guided local search for satisfiability and maximum satisfiability. Artificial Intelligence 158(1):1-26.