GSAT and dynamic backtracking

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

Volumn 874 LNCS, Issue , 1994, Pages 243-265

  Ginsberg, Matthew L ^a   McAllester, David ^b  

^a UNIVERSITY OF OREGON   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING; CONSTRAINT THEORY;

DYNAMIC BACKTRACKING; FREEDOM OF MOVEMENT; SEARCH SPACES; SEARCH TECHNIQUE; SYSTEMATICITY;

SEARCH ENGINES;

EID: 85028734538     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-58601-6_105     Document Type: Conference Paper

References (15)

1. V. Chvátal and E. Szemerédi. Many hard examples for resolution. JACM, 35:7592768, 1988.
2. James M. Crawford and Larry D. Auton. Experimental results on the crossover point in satisfiability problems. In Proceedings of the Eleventh National Conference on Artificial Intelligence, pages 21-27, 1993.
3. James M. Crawford and Andrew B. Baker. Experimental results on the application of satisfiability algorithms to scheduling problems. In Proceedings of the Twelfth National Conference on Artificial Intelligence, 1994.
4. M. Davis and H. Putnam. A computing procedure for quantification theory. J. Assoc. Comput. Much., 7:201-215, 1960.
5. Johan de Kleer. An assumption-based truth maintenance system. Artificial Intelligence, 28:127-162, 1986.
6. Matthew L. Ginsberg, Michael Frank, Michael P. Halpin, and Mark C. Torrance. Search lessons learned from crossword puzzles. In Proceedings of the Eighth National Conference on Artificial Intelligence, pages 210-215, 1990.
7. Matthew L. Ginsberg. Dynamic backtracking. Journal of Artificial Intelligence Research, 1:25-46, 1993.
8. S. Kirkpatrick, C.D. Gelatt, and M.P. Vecchi. Optimization by simulated annealing. Science, 220:671-680, 1982.
9. Kurt Konolige. Easy to be hard: Difficult problems for greedy algorithms. In Proceedings of the Fourth International Conference on Principles of Knowledge Representation and Reasoning, Bonn, Germany, 1994.
10. David A. McAllester. Partial order backtracking,. ai.mit, edu: /pub/dam/dynamic. ps, 1993.
11. Steven Minton, Mark D. Johnston, Andrew B. Philips, and Philip Laird. Solving large-scale constraint satisfaction and scheduling problems using a heuristic repair method. In Proceedings of the Eighth National Conference on Artificial Intelligence, pages 17-24, 1990.
12. Bart Selman and Henry Kautz. Domain-independent extensions to GSAT: Solving large structured satisfiability problems. In Proceedings of the Thirteenth International Joint Conference on Artificial Intelligence, pages 290-295, 1993.
13. 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.
14. Bart Selman, Henry A. Kautz, and Bram Cohen. Local search strategies for satisfiability testing. In Proceedings 1993 DIMA CS Workshop on Maximum Clique, Graph Coloring, and Satisfiability, 1993.
15. R. M. Stallman and G. J. Sussman. Forward reasoning and dependency-directed backtracking in a system for computer-aided circuit analysis. Artificial Intelligence, 9(2):135-196, 1977.