Scaling and probabilistic smoothing: Efficient dynamic local search for SAT

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

Volumn 2470, Issue , 2002, Pages 233-248

  Hutter, Frank ^a   Tompkins, Dave A D ^a   Hoos, Holger H ^a  

^a UNIVERSITY OF BRITISH COLUMBIA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

BENCHMARKING; COMPUTER PROGRAMMING; CONSTRAINT THEORY;

BENCH-MARK PROBLEMS; LOCAL SEARCH; SAT PROBLEMS; SEARCH STEPS; STATE OF THE ART; TIME COMPLEXITY;

LOCAL SEARCH (OPTIMIZATION);

EID: 84957015736     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46135-3_16     Document Type: Conference Paper

References (15)

1. J. Frank. Learning Short-term Clause Weights for GSAT. In Proc. IJCAI-97, pp. 384–389, Morgan Kaufmann Publishers, 1997.
2. H.H. Hoos. Stochastic Local Search — Methods, Models, Applications, PhD thesis, Darmstadt University of Technology, 1998.
3. H.H. Hoos. On the Run-time Behaviour of Stochastic Local Search Algorithms for SAT. In Proc. AAAI-99, pp. 661–666. AAAI Press, 1999.
4. H.H. Hoos. An Adaptive Noise Mechanism for WalkSAT. To appear in Proc.AAAI-02, AAAI Press, 2002.
5. H.H. Hoos and T. Stützle. Local Search Algorithms for SAT: An Empirical Evaluation. In J. of Automated Reasoning, Vol. 24, No. 4, pp. 421–481, 2000.
6. H.H. Hoos and T. Stützle. SATLIB: An Online Resource for Research on SAT. In I.P. Gent, H. Maaren, T. Walsh (ed.), SAT 2000, pp. 283–292, IOS Press, 2000.
7. H. Kautz and B. Selman. Pushing the Envelope: Planning, Propositional Logic, andSto chastic Search. In Proc. AAAI-96, pp. 1194–1201. AAAI Press, 1996.
8. D.A. McAllester and B. Selman and H. A. Kautz. Evidence for Invariants in Local Search. In Proc. AAAI-97, pp. 321–326, AAAI Press, 1997.
9. P. Morris. The breakout methodfor escaping from local minima. In Proc. AAAI- 93, pp. 40–45. AAAI Press, 1993.
10. D. Schuurmans, and, F. Southey. Local search characteristics of incomplete SAT procedures. In Proc. AAAI-2000, pp. 297–302, AAAI Press, 2000.
11. D. Schuurmans, F. Southey, and R. C. Holte. The exponentiateds ubgradient algorithm for heuristic boolean programming. In Proc. IJCAI-01, pp. 334-341, Morgan Kaufmann Publishers, 2001
12. B. Selman and H. A. Kautz. Domain-Independent Extensions to GSAT: Solving Large StructuredS atisfiability Problems. In Proc. IJCAI-93, pp. 290–295, Morgan Kaufmann Publishers, 1993.
13. B. Selman and H. A. Kautz and B. Cohen. Noise Strategies for Improving Local Search. In Proc. AAAI-94, pp. 337–343, AAAI Press, 1994.
14. B. Selman, H. Levesque and D. Mitchell. A New Methodf or Solving Hard Satisfiability Problems. In Proc. AAAI-92, pp. 440–446, AAAI Press, 1992.
15. Z. Wu and B. W. Wah. An Efficient Global-Search Strategy in Discrete Lagrangian Methods for Solving Hard Satisfiability Problems. In Proc. AAAI-00, pp. 310–315, AAAI Press, 2000.