GSAT: A new method for solving hard satisfiability problems (1992)

by Bart Selman , Hector Levesque , David Mitchell
Citations:2 - 0 self

Active Bibliography

685 A New Method for Solving Hard Satisfiability Problems – Bart Selman, Hector Levesque, David Mitchell - 1992
435 Planning as satisfiability – Henry Kautz, Bart Selman - 1992
528 Pushing the Envelope: Planning, Propositional Logic, and Stochastic Search – Henry Kautz, Bart Selman - 1996
582 Solving multiclass learning problems via error-correcting output codes – Thomas G. Dietterich, Ghulum Bakiri - 1995
802 Applied Cryptography -- Protocols, Algorithms, and . . . – Bruce Schneier
1058 The knowledge complexity of interactive proof systems – Shafi Goldwasser, Silvio Micali, Charles Rackoff - 1985
726 Proof verification and hardness of approximation problems – Sanjeev Arora, Carsten Lund, Rajeev Motwani, Madhu Sudan, Mario Szegedy - 1992
404 Minimizing Conflicts: A Heuristic Repair Method for Constraint-Satisfaction and Scheduling Problems – Steven Minton, Andy Philips, Mark D. Johnston, Philip Laird - 1993
276 Local Search Strategies for Satisfiability Testing – Bart Selman, Henry Kautz, Bram Cohen - 1995