Scaling and probabilistic smoothing: Dynamic local search for unweighted MAX-SAT

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

Volumn 2671, Issue , 2003, Pages 145-159

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

^a UNIVERSITY OF BRITISH COLUMBIA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ARTIFICIAL INTELLIGENCE; LEARNING ALGORITHMS; LOCAL SEARCH (OPTIMIZATION); COMPUTER SCIENCE; ENCODING (SYMBOLS); PROBABILITY; PROBLEM SOLVING; SCHEDULING;

COMBINATORIAL PROBLEM; CONFIGURATION PARAMETERS; GUIDED LOCAL SEARCH ALGORITHMS; LOCAL SEARCH ALGORITHM; MOST PROBABLE EXPLANATION; NATURAL EXTENSION; OPTIMAL SOLUTIONS; SCHEDULING PROBLEM;

PROBLEM SOLVING; COMBINATORIAL MATHEMATICS;

GUIDED LOCAL SEARCH ALGORITHM; MAX-SAT PROBLEMS; SAPS ALGORITHM; SCALING AND PROBABILISTIC SMOOTHING (SAPS);

EID: 7044221948     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44886-1_13     Document Type: Conference Paper

References (20)

1. B. Borchers and J. Furman. A two-phase exact algorithm for MAX-SAT and weighted MAX-SAT problems. In Journal of Combinatorial Optimization, Vol. 2, pp. 299–306, 1999.
2. P. Cheeseman, B. Kanefsky and W. M. Taylor. Where the Really Hard Problems Are. In Proceedings of the Twelfth International Joint Conference on Artificial Intelligence, IJCAI-91, pp.331–337, 1997.
3. J. Frank. Learning Short-term Clause Weights for GSAT. In Proc. IJCAI-97, pp. 384–389, Morgan Kaufmann Publishers, 1997.
4. P. Hansen and B. Jaumard. Algorithms for the maximum Satisfiability problem. In Computing, 44:279-303, 1990.
5. 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.
6. 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.
7. F. Hutter, D.A.D. Tompkins, and H.H. Hoos. Scaling and Probabilistic Smoothing: Efficient Dynamic Local Search for SAT. In LNCS 2470:Proc. CP-02, pp. 233–248, Springer Verlag, 2002.
8. P. Mills and E.P.K. Tsang. Guided Local Search for solving SAT and weighted MAX-SAT problems. In Journal of Automated Reasoning, Special Issue on Satisfiability Problems, pp. 24:205–223, Kluwer, 2000
9. P. Morris. The breakout method for escaping from local minima. In Proc. AAAI- 93, pp. 40–45. AAAI Press, 1993.
10. J. D. Park. Using Weighted MAX-SAT Engines to Solve MPE. In Proc. AAAI-02, pp. 682–687. AAAI Press, 2002.
11. D. Schuurmans and F. Southey. Local search characteristics of incomplete SAT procedures. In Proc. AAAI-2000, pp. 297–302, AAAI Press, 2000.
12. D. Schuurmans, F. Southey, and R.C. Holte. The exponentiated subgradient algorithm for heuristic boolean programming. In Proc. IJCAI-01, pp. 334-341, Morgan Kaufmann Publishers, 2001.
13. B. Selman and H.A. Kautz. Domain-Independent Extensions to GSAT: Solving Large Structured Satisfiability Problems. In Proc. IJCAI-93, pp. 290–295, Morgan Kaufmann Publishers, 1993.
14. B. Selman, H.A. Kautz, and B. Cohen. Noise Strategies for Improving Local Search. In Proc. AAAI-94, pp. 337–343, AAAI Press, 1994.
15. B. Selman, H. Levesque, and D. Mitchell. A New Method for Solving Hard Satisfiability Problems. In Proc. AAAI-92, pp. 440–446, AAAI Press, 1992.
16. B. Selman, D. G. Mitchell, and H. J. Levesque. Generating Hard Satisfiability Problems. In Artificial Intelligence, Vol. 81. pp. 17–29, 1996.
17. K. Smyth, H. H. Hoos, and T. Stützle. Iterated Robust Tabu Search for MAXSAT. In Proc. of the 16th Canadian Conference on Artificial Intelligence (AI 2003), to appear, 2003.
18. 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.
19. M. Yagiura and T. Ibaraki. Analyses on the 2 and 3-Flip Neighborhoods for the MAX SAT. In Journal of Combinatorial Optimization, Vol. 3, No. 1, pp. 95-114, July 1999.
20. M. Yagiura and T. Ibaraki. Efficient 2 and 3-Flip Neighborhood Search Algorithms for the MAX SAT: Experimental Evaluation. In Journal of Heuristics, Vol. 7, No. 5, pp. 423-442, 2001.