Adaptive clause weight redistribution

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

Volumn 4204 LNCS, Issue , 2006, Pages 229-243

  Ishtaiwi, Abdelraouf ^a,b   Thornton, John ^a,b   Anbulagan, ^b   Sattar, Abdul ^a,b   Pham, Duc Nghia ^a,b  

^a GRIFFITH UNIVERSITY   (Australia)

^b CSIRO   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

BENCHMARKING; PARAMETER ESTIMATION; PROBLEM SOLVING; SEARCH ENGINES;

ADAPTIVE CLAUSE WEIGHT REDISTRIBUTION; DOMAIN DEPENDENT PARAMETERS; DYNAMIC LOCAL SEARCH (DLS); PROPOSITIONAL SATISFIABILITY PROBLEMS;

ALGORITHMS;

EID: 33750333974     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11889205_18     Document Type: Conference Paper

References (20)

1. Morris, P.: The Breakout method for escaping from local minima. In: Proceedings of 11th AAAI. (1993) 40-45
2. Cha, B., Iwama, K.: Adding new clauses for faster local search. In: Proceedings of 13th AAAI. (1996) 332-337
3. Frank, J.: Learning short-term clause weights for GSAT. In: Proceedings of 15th IJCAI. (1997) 384-389
4. McAllester, D., Selman, B., Kautz, H.: Evidence for invariants in local search. In: Proceedings of 14th AAAI. (1997) 321-326
5. Wu, Z., Wah, B.: An efficient global-search strategy in discrete Lagrangian methods for solving hard satisfiability problems. In: Proceedings of 17th AAAI. (2000) 310-315
6. Schuurmans, D., Southey, F.: Local search characteristics of incomplete SAT procedures. In: Proceedings of 10th AAAI. (2000) 297-302
7. Hutter, F., Tompkins, D., Hoos, H.: Scaling and Probabilistic Smoothing: Efficient dynamic local search for SAT. In: Proceedings of 8th CP. (2002) 233-248
8. Thornton, J., Pham, D.N., Bain, S., Ferreira Jr., V.: Additive versus multiplicative clause weighting for SAT. In: Proceedings of 19th AAAI. (2004) 191-196
9. Hoos, H.: An adaptive noise mechanism for WalkSAT. In: Proceedings of 19th AAAI. (2002) 655-660
10. Ishtaiwi, A., Thornton, J., Sattar, A., Pham, D.N.: Neighbourhood clause weight redistribution in local search for SAT. In: Proceedings of 11th CP. (2005) 772-776
11. Schuurmans, D., Southey, F., Holte, R.: The exponentiated subgradient algorithm for heuristic boolean programming. In: Proceedings of 17th IJCAI. (2001) 334-341
12. Anbulagan, Pham, D., Slaney, J., Sattar, A.: Old resolution meets modern SLS. In: Proceedings of 20th AAAI. (2005) 354-359
13. Li, C.M., Huang, W.: Diversification and determinism in local search for satisfiability. In: Proceedings of 8th SAT. (2005) 158-172
14. Mills, P., Tsang, E.: Guided local search applied to the satisfiability (SAT) problem. In: Proceedings of 15th ASOR. (1999) 872-883
15. Thornton, J.: Clause weighting local search for SAT. Journal of Automated Reasoning (2006) (to appear)
16. Hutter, F., Hamadi, Y.: Parameter adjustment based on performance prediction: Towards an instance aware problem solver. In: Technical Report: MSR-TR-2005-125, Microsoft Research, WA. (2005)
17. Li, C.M., Anbulagan: Look-ahead versus look-back for satisfiability problems. In: Proceedings of 3rd CP. (1997) 341-355
18. Quine, W.V.: A way to simplify truth functions. American Mathematical Monthly 62 (1955) 627-631
19. Davis, M., Putnam, H.: A computing procedure for quantification theory. Journal of the ACM 7 (1960) 201-215
20. Robinson, J.A.: A machine-oriented logic based on the resolution principle. Journal of the ACM 12 (1965) 23-41