A New Method for Solving Hard Satisfiability Problems (1992)

by Bart Selman , Hector Levesque , David Mitchell
Venue:AAAI
Citations:707 - 22 self

Active Bibliography

2 GSAT: A new method for solving hard satisfiability problems – Bart Selman, Hector Levesque, David Mitchell - 1992
276 Local Search Strategies for Satisfiability Testing – Bart Selman, Henry Kautz, Bram Cohen - 1995
217 Domain-Independent Extensions to GSAT: Solving Large Structured Satisfiability Problems – Bart Selman, Henry Kautz - 1993
435 Planning as satisfiability – Henry Kautz, Bart Selman - 1992
126 Algorithms for the Satisfiability (SAT) Problem: A Survey – Jun Gu, Paul W. Purdom, John Franco, Benjamin W. Wah - 1996
220 Hard and Easy Distributions of SAT Problems – David Mitchell, Bart Selman, Hector Levesque - 1992
802 Applied Cryptography -- Protocols, Algorithms, and . . . – Bruce Schneier
726 Proof verification and hardness of approximation problems – Sanjeev Arora, Carsten Lund, Rajeev Motwani, Madhu Sudan, Mario Szegedy - 1992
528 Pushing the Envelope: Planning, Propositional Logic, and Stochastic Search – Henry Kautz, Bart Selman - 1996