Resolution complexity of random constraints

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

Volumn 2470, Issue , 2002, Pages 295-310

  Mitchell, David G ^a  

^a SIMON FRASER UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING; CONSTRAINT THEORY;

EVALUATING ALGORITHMS; EXPONENTIAL RUNNING TIME; FINITE DOMAIN CONSTRAINTS; PROOF SYSTEM; RANDOM CONSTRAINTS; RANDOM INSTANCE; RESOLUTION COMPLEXITY; SATISFIABILITY;

CONSTRAINT SATISFACTION PROBLEMS;

EID: 35248826717     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46135-3_20     Document Type: Conference Paper

References (24)

1. D. Achlioptas, P. Beame, and M. Molloy. A sharp threshold in proof complexity. In Proc., 33rd Annual ACM Symp. on the Theory of Computing (STOC-01), pages 337–346, 2001.
2. D. Achlioptas, L. Kirousis, E. Kranakis, D. Krizanc, M. Molloy, and Y. Stamatiou. Random constraint satisfaction: A more accurate picture. Constraints, 6(4):329– 344, 2001.
3. R. Aharoni and N. Linial. Minimal unsatisfiable formulas and minimal non-twocolorable hypergraphs. J. of Combinatorial Theory, Series A, 43:196–204, 1986.
4. Andrew B. Baker. Intelligent Backtracking on Constraint Satisfaction Problems: Experimental and Theoretical Results. PhD thesis, University of Oregon, 1995.
5. P. Beame, R. Karp, T. Pitassi, and M. Saks. On the complexity of unsatisfiability proofs for random k-CNF formulas. In Proc., 30th Annual ACM Symp. on the Theory of Computing (STOC-98), pages 561–571, May 1998.
6. E. Ben-Sasson and A. Wigderson. Short proofs are narrow: Resolution made simple. In Proc., 31st Annual Symp. on the Theory of Computing (STOC-99), pages 517–526, May 1999. (Also appears as ECCC report TR99-022).
7. P. Cheesman, B. Kanefsky, and W.M. Taylor. Where the really hard problems are. In Proc., 12th Int’l. Joint Conf. on A. I. (IJCAI-91), 1991.
8. V. Chvátal and B. Reed. Mick gets some (the odds are on his side). In Proc. of the 33rd Symp. on the Foundations of Comp. Sci. (FOCS-92), pages 620–628, 1992.
9. V. Chvátal and E. Szemerédi. Many hard examples for resolution. Journal of the ACM, 35(4):759–768, 1988.
10. J. De Kleer. A comparison of ATMS and CSP techniques. In Proc. of the 11th Int’l. Joint Conf. on A. I. (IJCAI-89), pages 290–296, 1989.
11. R. Dechter. Enhancement schemes for constraint processing: Backjumping, learning, and cutset decomposition. Artificial Intelligence, 41:273–312, 1990.
12. R. Dechter and D. Frost. Backtracking algorithms for constraint satisfaction problems. Technical report, Dept. of Inf. & Comp. Sci., U. of California, Irvine, 1999.
13. J. Gashnig. Experimental case studies of backtrack vs. Waltz-type vs. new algorithms for satisficing assignment problems. In Proc. of the Canadian Artificial Intelligence Conference, pages 268–277, 1978.
14. I.P. Gent, E. MacIntyre, P. Prosser, B. M. Smith, and T. Walsh. Random constraint satisfaction: flaws and structure. Constraints, 6(4):345–372, October 2001.
15. O. Kullmann. Upper and lower bounds on the complexity of generalized resolution and generalized constraint satisfaction problems. Submitted, 2000.
16. A.K. Mackworth and E. C. Freuder. The complexity of some polynomial network consistency algorithms for constraint satisfaction problems. Artificial Intelligence, 25:65–73, 1985.
17. D. G. Mitchell. Hard problems for CSP algorithms. In Proc., 15th Nat. Conf. on Artificial Intelligence (AAAI-98), pages 398–405, 1998.
18. D. G. Mitchell. The Resolution Complexity of Constraint Satisfaction. PhDthesis, University of Toronto, 2002.
19. D. G. Mitchell. Constraint satisfaction and resolution. In preparation.
20. D.G. Mitchell, B. Selman, and H. J. Levesque. Hard and easy distributions of SAT problems. In Proc. of the 10th Nat. Conf. on A. I. (AAAI’92), pages 459– 462, 1992.
21. M. Molloy. Models and thresholds for random constraint satisfaction problems. In Proc., 34th Annual Symp. on the Theory of Computing (STOC-02), pages 209– 217. ACM, 2002.
22. P. Prosser. Hybrid algorithms for the constraint satisfaction problem. Computational Intelligence, 9(3):268–299, August 1993.
23. P. Prosser. An empirical study of phase transitions in binary constraint satisfaction problems. Artificial Intelligence, 81:81–109, 1996.
24. T. J. Schaefer. The complexity of satisfiability problems. In Proc., 10th Annual ACM Symp. on the Theory of Computing (STOC-78), pages 216–226. ACM, 1978.