Random constraint satisfaction: Theory meets practice

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

Volumn 1520, Issue , 1998, Pages 325-339

  Macintyre, Ewan ^a   Prosser, Patrick ^a   Smith, Barbara ^b   Walsh, Toby ^a  

^a UNIVERSITY OF STRATHCLYDE   (United Kingdom)

^b UNIVERSITY OF LEEDS   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT THEORY;

CONVENTIONAL MODELS; PROBLEM SIZE; RANDOM CONSTRAINTS; RANDOM PROBLEM;

COMPUTER PROGRAMMING;

EID: 84957371005     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-49481-2_24     Document Type: Conference Paper

References (15)

1. D. Achlioptas, L.M. Kirousis, E. Kranakis, D. Krizanc, M.S.O. Molloy, and C. Stamatiou. Random constraint satisfaction: A more accurate picture. In Pro- ceedings of Third International Conference on Principles and Practice of Con- straint Programming (CP97), pages 107-120, 1997.
2. P. Cheeseman, B. Kanefsky, and W.M. Taylor. Where the really hard problems are. In Proceedings of the 12th IJCAI, pages 331-337. International Joint Conference on Artificial Intelligence, 1991.
3. E. Friedgut. Sharp thresholds for graph properties and the k-SAT problem, 1998. Unpublished manuscript.
4. A. Frieze and S. Suen. Analysis of two simple heuristics on a random instance of k-SAT. Journal of Algorithms, 20:312-355, 1996.
5. I.P. Gent, E. MacIntyre, P. Prosser, P. Shaw, and T. Walsh. The constrainedness of arc consistency. In 3rd International Conference on Principles and Practices of Constraint Programming (CP-97), pages 327-340. Springer, 1997.
6. I.P. Gent, E. MacIntyre, P. Prosser, B.M. Smith, and T. Walsh. An empirical study of dynamic variable ordering heuristics for the constraint satisfaction prob- lem. In 2nd International Conference on Principles and Practices of Constraint Programming (CP-96), pages 179-193, 1996.
7. I.P. Gent, E. MacIntyre, P. Prosser, and T. Walsh. Scaling effects in the CSP phase transition. In 1st International Conference on Principles and Practices of Constraint Programming (CP-95), pages 70-87. Springer-Verlag, 1995.
8. I.P. Gent, E. MacIntyre, P. Prosser, and T. Walsh. The constrainedness of search. In Proceedings of the 13th National Conference on AI, pages 246-252. American Association for Artificial Intelligence, 1996.
9. I.P. Gent, E. MacIntyre, P. Prosser, and T. Walsh. The scaling of search cost. In Proceedings of the 14th National Conference on AI, pages 315-320. American Association for Artificial Intelligence, 1997.
10. I.P. Gent and T. Walsh. Phase transitions from real computational problems. In Proceedings of the 8th International Symposium on Artificial Intelligence, pages 356-364, 1995.
11. C. Gomes and B. Selman. Problem structure in the presence of perturbations. In Proceedings of the 14th National Conference on AI, pages 221-226. American Association for Artificial Intelligence, 1997.
12. S. Grant and B.M. Smith. The phase transition behaviour of maintaining arc consistency. Research Report 95.25, School of Computer Studies, University of Leeds, 1995. A revised and shortened version appears in Proceedings of 12th ECAI, pages 175-179, 1996.
13. L.M. Kirousis, E. Kranakis, and D. Krizanc. Approximating the unsatisfiability threshold of random formulas. In Proceedings of the 4th Annual European Sym- posium on Algorithms (ESA'96), pages 27-38, 1996.
14. D. Mitchell, B. Selman, and H. Levesque. Hard and Easy Distributions of SAT Problems. In Proceedings of the 10th National Conference on AI, pages 459-465. American Association for Artificial Intelligence, 1992.
15. C. Williams and T. Hogg. Exploiting the deep structure of constraint problems. Artificial Intelligence, 70:73-117, 1994.