Systematic Versus Stochastic Constraint Satisfaction

IJCAI International Joint Conference on Artificial Intelligence

Volumn 2, Issue , 1995, Pages 2027-2032

  Freuder, Eugene C ^a   Dechter, Rina ^b   Ginsberg, Matthew L ^c   Selman, Bart ^d   Tsang, Edward ^e  

^a UNIVERSITY OF NEW HAMPSHIRE   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c UNIVERSITY OF OREGON   (United States)

^d LUCENT TECHNOLOGIES   (United States)

^e UNIVERSITY OF ESSEX   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE;

CONSTRAINT SATISFACTION; STOCHASTIC CONSTRAINTS; STOCHASTIC CONTROL; SYSTEMATIC CONTROL;

STOCHASTIC SYSTEMS;

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

References (28)

1. [Chvatal and Szemeredi, 1988] V. Chvatal and E. Szemeredi. Many hard examples for resolution. J ACM, vol. 35, no. 4, 1988, 759-208.
2. [Crawford and Auton, 1993] J.M. Crawford and L.D. Auton. Experimental results on the cross-over point in satisfiability problems. AAAI93, 1993.
3. [Davenport et al, 1994] A. J. Davenport, E. P. K. Tsang, C. J. Wang, and K. Zhu. GENET: A connectionist architecture for solving constraint satisfaction problems by iterative improvement. In Proc, 12th National Conference on Artificial Intelligence (AAAI), volume 1, pages 325-330, 1994.
4. [Davis, 1987] L. Davis. Genetic algorithms and simulated annealing. Research notes in A I . Pitman/Morgan Kaufmann, 1987.
5. [Dechter 1990] R. Dechter. "Constraint networks."Encyclopedia of Artificial Intelligence (2nd Ed.), John Wiley, New York, pp. 276-285, 1991.
6. [Freuder and Mackworth, 1994] E. Freuder and A. Mackworth, editors. Constraint-Based Reasoning. MIT Press, Cambridge, MA, USA, 1994.
7. [Freuder, 1994] E. Freuder. Exploiting structure in constraint satisfaction problems. In Constraint Programming, Mayoh, Tyugu, Penjam, editors, Springer- Verlag, Berlin, pp. 51-74, 1994.
8. [Frost and Dechter, 1994] D. Frost and R. Dechter. "In search of the best backtracking search"In AAAI-94, pp. 301-306, 1994.
9. [Ghedira, 1994] K. Ghedira. Dynamic partial constraint satisfaction by multi-agent and simulated annealing. In Workshop on Constraint Satisfaction Issues Raised by Practical Applications, 11th European Conference on Artificial Intelligence, 1994.
10. [Ginsberg and McAUester, 1994] Matthew L. Ginsberg and David A. McAUester. GSAT and dynamic backtracking. In Proceedings of the Fourth International Conference on Principles of Knowledge Representation and Reasoning, Bonn, Germany, 1994.
11. [Ginsberg, 1993] Matthew L. Ginsberg. Dynamic backtracking. Journal of Artificial Intelligence Research, 1:25-46, 1993.
12. [Hogg & Williams, 1994] T. Hogg and C. P. Williams. "Expected gains from parallelizing constraint solving for hard problems,"in AAAI-94, pp. 331-336, 1994
13. [Harvey and Ginsberg, 1995] William D. Harvey and Matthew L. Ginsberg. Limited discrepancy search. In Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, 1995.
14. [Kask & Dechter, 1995] K. Kask and R. Dechter. "GSAT and local consistency,"in IJCAI-95, 1995.
15. [Konolige, 1994] K. Konolige. "Easy to hard: Difficult problems for greedy algorithms"Knowledge Representation, pages 374-378, 1994.
16. [Langley, 1992] Pat Langley. Systematic and nonsystematic search strategies. In Artificial Intelligence Planning Systems: Proceedings of the First International Conference, pages 145-152. Morgan Kaufmann, 1992.
17. [Mackworth & Freuder, 1984] A. Mackworth and E. Freuder. "The complexity of some polynomial search algorithms for constraint satisfaction problems,"Artificial Intelligence, Vol. 25, No. 1, 1984.
18. [Minton et al., 1992] S. Minton, M. Johnston, A.B. Philips, and P. Laird. Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems. Artificial Intelligence, 58:161-205, 1992. [Muhlenbein et al, 1991]
19. H. Muhlenbein, M. Schomisch, and J. Born. The parallel genetic algorithm as function optimizer. Parallel Computing, 17:619-632, 1991.
20. [Pearl, 1984] J. Pearl. "Heuristics, Intelligent search strategies for computer problem solving,"Addison Wesley, 1984.
21. [Pinkas and Dechter, 1995 to appear] G. Pinkas and R. Dechter. On improving connectionist energy minimization. Journal of Artificial Intelligence Research, 1995, to appear.
22. [Selman et al, 1992] Bart Selman, Hector Levesque, and David Mitchell. A new method for solving hard satisfiability problems. In Proceedings of the Tenth National Conference on Artificial Intelligence, pages 440-446, 1992.
23. [Smith and Cheng, 1993] Stephen F. Smith and Cheng- Chung Cheng. Slack-based heuristics for constraint satisfaction scheduling. AAAI-93, pp. 139-144, 1993.
24. [Smith, 1992] Douglas R. Smith. Transformational approach to scheduling. Technical Report KES.U.92.2, Kestrel Institute, 1992.
25. [Tsang, 1993] E.P.K. Tsang. Foundations of Constraint Satisfaction. Academic Press, 1993.
26. [Warwick and Tsang, 1994] T. Warwick and E. P. K. Tsang. Using a genetic algorithm algorithm to tackle the processors configuration problem. In Proc. ACM Symposium on Applied Computing (SAC), pages 217- 221, 1994.
27. [Verfaillie and Schiex, 1994] G. Verfaillie and T. Schiex. Solution reuse in dynamic constraint satisfaction problems. AAAI-94, pp. 307-312, 1994.
28. [Yokoo, 1994] M. Yokoo. Weak-commitment search for solving constraint satisfaction problems. AAAI-94, pp. 313-318, 1994.