2-Way vs. d-way branching for CSP

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

Volumn 3709 LNCS, Issue , 2005, Pages 343-357

  Hwang, Joey ^a   Mitchell, David G ^a  

^a SIMON FRASER UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; LEARNING SYSTEMS; TREES (MATHEMATICS);

C-RES; CSP; D-WAY BRANCHING; NG-RES;

CONSTRAINT THEORY;

EID: 33646176807     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11564751_27     Document Type: Conference Paper

References (14)

1. Andrew B. Baker. Intelligent Backtracking on Constraint Satisfaction Problems: Experimental and Theoretical Results. PhD thesis, University of Oregon, 1995.
2. Paul Beame, Henry Kautz, and Ashish Sabharwal. Towards understanding and harnessing the potential of clause learning. Journal of Artificial Intelligence Research, 22:319-351, 2004.
3. Eli Ben-Sasson, Russell Irnpagliazzo, and Avi Wigderson. Near-optimal separation of treelike and general resolution. Technical Report TR01-005, Electronic Colloquium on Computational Complexity (ECCC), 2000.
4. M. L. Bonet, J. L. Esteban, N. Calesi, and J. Johansen. Exponential separations between restricted resolution and cutting planes proof systems. In Proc. of the 39th Annual IEEE Symposium on Foundations of Computer Science (FOCS'98), pages 638-647. IEEE Press, 1998.
5. M. L. Bonet and N. Galesi. A study of proof search algorithms for resolution arid polynomial calculus. In Proc, 40th Symposium on Foundations of Computer Science, pages 422-432, 1999.
6. J. Buresh-Oppenheim, D. Mitchell, and T. Pitassi. Linear and negative resolution are weaker than resolution. Technical Report TR01-074, Electronic Colloquium on Computational Complexity (ECCC), 2001.
7. J.R. Celoni, W.J. Paul, and R.E. Tarjan. Space bounds for a game on graphs. Mathematical. Systems Theory, 10:239-251, 1977.
8. Cho Yee Joey Hwang. A theoretical comparison of resolution proof systems for csp algorithms. Master's thesis, Simon Fraser University, 2004.
9. B. Krishnamurthy. Short proofs for tricky formulas. Acta Informatica, 22:253-274, 1985.
10. David G. Mitchell. The Resolution Complexity of Constraint Satisfaction. PhD thesis, University of Toronto, 2002.
11. David G. Mitchell. Resolution and constraint satisfaction. In Lecture Notes in Computer Science, LNCS 2833, pages 555-569. Springer, 2003.
12. V. Park. An empirical study of different branching strategies for constraint satisfaction problems. Master's thesis, University of Waterloo, 2004.
13. B. M. Smith and P. Sturdy. An empirical investigation of value ordering for finding all solutions. Presented at the ECAI 2004 workshop on Modelling and Solving Problems with Constraints.
14. G. Stalmarck. Short resolution proofs for a sequence of tricky formulas. Acta Informatica, 33:277-280, 1996.