Additive versus multiplicative clause weighting for SAT

Proceedings of the National Conference on Artificial Intelligence

Volumn , Issue , 2004, Pages 191-196

  Thornton, John ^a   Pham, Duc Nghia ^a   Bain, Stuart ^a   Ferreira Jr , Valoir ^a  

^a GRIFFITH UNIVERSITY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ARTIFICIAL INTELLIGENCE; PARAMETER ESTIMATION; PROBABILISTIC LOGICS; PROBLEM SOLVING; TUNING;

CLAUSE WEIGHTING SCHEME; LOCAL MINIMA; MULTIPLICATIVE ALGORITHMS (SAPS); PURE ADDITIVE WEIGHTING SCHEME (PAWS);

CONSTRAINT THEORY;

EID: 9444249836     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (11)

1. Gibbons, J., and Chakraborti, S. 1992. Nonparametric Staistical Inference. Statistics: Textbooks and Monographs. New York: Marcel Dekker, Inc. 241-251.
2. Hoos, H. 2002. An adaptive noise mechanism for Walk-SAT. In Proceedings of the Nineteenth National Conference on Artificial Intelligence (AAAI-02), 655-660.
3. Hutter, F.; Tompkins, D.; and Hoos, H. 2002. Scaling and probabilistic smoothing: Efficient dynamic local search for SAT. In Proceedings of the Eighth International Conference on the Principles and Practice of Constraint Programming (CP'02), 233-248.
4. Li, C., and Anbulagan. 1997. Look-ahead versus look-back for satisfiability problems. In Proceedings of the Third International Conference on the Principles and Practice of Constraint Programming (CP'97), 341-355.
5. McAllester, D.; Selman, B.; and Kautz, H. 1997. Evidence for invariance in local search. In Proceedings of the Fourteenth National Conference on Artificial Intelligence (AAAI-97), 321-326.
6. Mills, P., and Tsang, E. 1999. Guided local search applied to the satisfiability (SAT) problem. In Proceedings of the 15th National Conference of the Australian Society for Operations Research (ASOR'99), 872-883.
7. Morris, P. 1993. The Breakout method for escaping local minima. In Proceedings of the Eleventh National Conference on Artificial Intelligence (AAAI-93), 40-45.
8. Prestwich, S. 2003. Local search on SAT-encoded CSPs. In Proceedings of the Sixth International Conference on Theory and Applications of Satisfiability Testing (SAT-03).
9. Schuurmans, D., and Southey, F. 2000. Local search characteristics of incomplete SAT procedures. In Proceedings of the Seventeenth National Conference on Artificial Intelligence (AAAI-00), 297-302.
10. Schuurmans, D.; Southey, F.; and Holte, R. 2001. The exponentiated subgradient algorithm for heuristic Boolean programming. In Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence (IJCAI01), 334-341.
11. Wu, Z., and Wah, B. 2000. An efficient global-search strategy in discrete Lagrangian methods for solving hard satisfiability problems. In Proceedings of the Seventeenth National Conference on Artificial Intelligence (AAAI-00), 310-315.