GSAT and dynamic backtracking
暂无分享,去创建一个
[1] Steven Minton,et al. Solving Large-Scale Constraint-Satisfaction and Scheduling Problems Using a Heuristic Repair Method , 1990, AAAI.
[2] C. D. Gelatt,et al. Optimization by Simulated Annealing , 1983, Science.
[3] Johan de Kleer,et al. An Assumption-Based TMS , 1987, Artif. Intell..
[4] James M. Crawford,et al. Experimental Results on the Application of Satisfiability Algorithms to Scheduling Problems , 1994, AAAI.
[5] Matthew L. Ginsberg,et al. Dynamic Backtracking , 1993, J. Artif. Intell. Res..
[6] Hilary Putnam,et al. A Computing Procedure for Quantification Theory , 1960, JACM.
[7] Gerald J. Sussman,et al. Forward Reasoning and Dependency-Directed Backtracking in a System for Computer-Aided Circuit Analysis , 1976, Artif. Intell..
[8] Endre Szemerédi,et al. Many hard examples for resolution , 1988, JACM.
[9] Michael C. Frank,et al. Search Lessons Learned from Crossword Puzzles , 1990, AAAI.
[10] Bart Selman,et al. Domain-Independent Extensions to GSAT : Solving Large StructuredSatis ability , 1993 .
[11] Hector J. Levesque,et al. A New Method for Solving Hard Satisfiability Problems , 1992, AAAI.
[12] Kurt Konolige,et al. Easy to be Hard: Difficult Problems for Greedy Algorithms , 1994, KR.
[13] Bart Selman,et al. Local search strategies for satisfiability testing , 1993, Cliques, Coloring, and Satisfiability.