Predicting phase transitions of binary constraint satisfaction problems with constraint graph information

Intelligent Data Analysis

Volumn 2, Issue 1, 1998, Pages 45-62

  Kwan, Alvin C M ^a   Tsang, Edward P K ^b   Borrett, James E ^b  

^a HONG KONG POLYTECHNIC UNIVERSITY   (Hong Kong)

^b UNIVERSITY OF ESSEX   (United Kingdom)

Author keywords

Constraint satisfaction problem; Phase; transition

Indexed keywords

BINS; CONSTRAINT THEORY; GRAPH THEORY; TOPOLOGY;

ALGORITHM DEVELOPMENT; ALGORITHM SELECTION; BINARY CONSTRAINT SATISFACTION; CONSTRAINED PROBLEM; CONSTRAINT SATISFACTION; PHASE; RECENT RESEARCHES; TRANSITION;

CONSTRAINT SATISFACTION PROBLEMS;

EID: 33846321007     PISSN: 1088467X     EISSN: 15714128     Source Type: Journal    
DOI: 10.3233/IDA-1998-2105     Document Type: Article

References (36)

1. Bessiere, C. and Regin, J.C. MAC and Combined Heuristics: Two Reasons to Forsake FC (and CBJ?) on Hard Problems. In Proceedings of the 2nd International Conference on Principle and Practice of Constraint Programming (CP'96), SpringerVerlag, Cambridge, Massachusetts, 1118,61-75,1996.
2. Barrett, J.E., Tsang, E.P.K. and Walsh, N.R. Adaptive Constraint Satisfaction: The Quickest First Principle. In Proceedings of the 12th European Conference on Artificial Intelligence (ECAI-96), John Wiley & Sons, Budapest, Hungary, 160-164, 1996.
3. Brelaz, D. New Methods to Color the Vertices of a Graph. Communications of the ACM 22 (4), 251-256, 1979.
4. Cheeseman, P., Kanefsky, B. and Taylor, W.M. Where the Really Hard Problems Are. In Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI-9J), Morgan Kaufmann, Sydney, Australia, 331-337, 1991.
5. Colmerauer, A. In Introduction to Prolog III. Communications of the ACM 33(7),69-90.
6. Cras, J.-Y. A Review of Industrial Constraint Solving Tools. AI Intelligence, 1993. 61
7. Crawford, J.M. and Auton, L.D. Experimental Results on the Crossover Point in Satisfiability. In Proceedings of the 11th National Conference on Artijicial Intelligence (AAAI-93), AAAIWashington, DC, 21-27,1993.
8. Dent, M.J. and Mercer, RE. A New Model of Hard Binary Constraint Satisfaction Problems. In McCalla, G. (ed.): Advances in Artificial Intelligence. Proceedings of the 11th Biennial Conference of the Canadian society for Computational Studies of Intelligence (AI'96), Springer-Verlag, Toronto, Canada, 1081, 14-25, 1996.
9. Dincbas, M., Van Hentemyck, P., Simonis, H., Aggoun, A., Graf, T. and Berthier, F. The Constraint Logic Programming Language CHIP. In ProceEdings of the International Conference on Fifth Generation Computer Systems (FGCS'88), Springer-Verlag, Tokyo, Japan, 693-702, 1988.
10. Gent, I.P. and Walsh, T. The SAT Phase Transition. In Proceedings of the 11th European Conference on Artijicial Intelligence (ECAI-94), John Wiley & Sons, Amsterdam, Netherlands, 105-109, 1994.
11. Gent, I.P. and Walsh, T. Phase Transitions from Real Computational Problems. In Proceedings of the CP'95 Workshop on Studying and Solving Really Hard Problems, 1st International Conference on Principles and Practice of Constraint Programming, Cassis, France, 70-83, September 1995.
12. Gent, J.P. & Walsh, T. Phase Transitions and Annealed Theories: Number Partitioning as a Case Study. In Proceedings of the 12th European Conference on Artijiciallntelligence, John Wiley & Sons, Budapest, Hungary, 170-174, 1996.
13. Gent, I.P., MacIntype, E., Prosser, P. & Walsh, T. The Constrainedness of Search. In Proceedings of the National Conference on Artijicial Intelligence (AAAI-96), AAAI Press, Portland, Oregon, 246-252, 1996.
14. Gent, J.P., MacIntype, E., Prosser, P. & Walsh, T. The Scaling of Search Cost. To appear in Proceedings of the 14th National Conference on Artijiciaiintelligence (AAAI-97), AAAI Press, Rhode Island, 1997.
15. Haralick, RM. & Elliott, G.L. Increasing Tree Search Efficiency for Constraint Satisfaction Problems. Artijicial Intelligence 14, 263-314, 1980.
16. Hogg, T. Refining the Phase Transition in Combinatorial Search. Artificial Intelligence 81, 127-154, 1996.
17. Hogg, T., Huberman, B.A. & William, c.P. Phase Transitions and the Search Problem. Artijiciaiintelligence 81, 1-15, 1996.
18. Kondrak, G. & van Beek, P. A Theoretical Evaluation of Selected Backtracking Algorithms. In Proceedings of the 14th International Joint Conference on Artificial Intelligence, Morgan Kaufmann, Montreal, Canada, 541-547, 1995.
19. Kwan, A.C.M., Tsang, E.P.K. & Borrett, J.E. Phase Transition in Finding Multiple Solutions in Constraint Satisfaction Problems. In Proceedings CP'95 Workshop on Studying and Solving Really Hard Problems, Cassis, France, 119-126, 1995.
20. Kwan, A. A Framework For Mapping Constraint Satisfaction Problems To Solution Methods. PhD Thesis, Department of Computer Science, University of Essex, Colchester, UK, May 1997.
21. Lever, J., Wallace, M. & Richards, B. Constraint Logic Programming For Scheduling And Planning. British Telecom Technology Journal, 13(1), 73-80, 1995.
22. Mitchell, D., Selman, B. & Levesque, H. Hard and Easy distributions of SAT Problems. In Proceedings of the 10th National Conference on Artijiciaiintelligence (AAAI-93), AAAI Pre"s, Washington, DC, 459-465, 1992.
23. Proceedings of the 2nd International Conference on the Practical Application of Constraint Technology. Practical Application, London, United Kingdom, 1996.
24. Prosser, P. Hybrid Algorithms for the Constraint Satisfaction Problem. Computational Intelligence 9 (3),268-299, 1993.
25. Prosser, P. Forward Checking with Backmarking. In Meyer (ed.): Constraint Processing, Springer-Verlag, 923, 185-204, 1995.
26. Prosser, P. An Empirical Study of Phase Transitions in Binary Constraint Satisfaction Problems. Artificial Intelligence 81, 81-109, 1996.
27. Puget, J.-F. A C++ Implementation of CLP. Technical Report, ILOG S.A., 1994.
28. Sabin, D. & Freuder, E. Contradicting Conventional Wisdom in Constraint Satisfaction. In Proceedings of the 11th European Conference on Artijicial Intelligence, John Wiley & Sons, Amsterdam, Netherlands, 125-129,1994.
29. Schrag, R and Miranker, D. Abstraction and the CSP Phase Transition Boundary. In Proceedings of the 4th International Symposium on Artijiciaiintelligence and Mathematics (AIIMath-96), 138-141, January 1996.
30. Smith, B.M. The Phrase Transition and the Mushy Region in Constraint Satisfaction Problems. In Proceedings of the 11th European Conference on Artificial Intelligence (ECAI-94), John Wiley & Sons, Amsterdam, Netherlands, 100-104, 1994.
31. Smith, B.M. and Dyer, M.E. Locating the Phase Transition in Binary Constraint Satisfaction Problems. Artificial Intelligence 81, 155-181, 1996.
32. Tsang, E. Foundations of Constraint Satisfaction. Academic Press, 1993.
33. Tsang, E.P.K., Bonett, J.E. and Kwan, A.C.M. An Attempt to Map the Performance of a Range of Algorithm and Heuristic Combinations. In Hallam, J. (ed.): Hybrid Problems, Hybrid Solutions. Proceedings of the Conference on Artificial Intelligence and the Simulation of Behaviour (AISB-95), lOS Press, 203-216, 1995.
34. Wallace, M. Practical Applications of Constraint Programming. Constraints 1, 139-168, 1996.
35. Williams, C. and Hogg, T. Exploiting the Deep Structure of Constraint Problems. Artificial Intelligence 70, 73-117, 1994.
36. Vlasie, D.R. Systematic Generation of Very Hard Cases for Graph-3-Colorability. In Proceedings CP'95 Workshop on Studying and Solving Really Hard Problems, Cassis, France, 188-193, 1995.