Complete local search for propositional satisfiability

Proceedings of the National Conference on Artificial Intelligence

Volumn , Issue , 2004, Pages 161-166

  Fang, Hai ^a   Ruml, Wheeler ^b  

^a Yale University   (United States)

^b PALO ALTO RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

LOCAL GRADIENT INFORMATION; PROPOSITIONAL SATISFIABILITY PROBLEM (SAT); REPAIR-BASED METHODS; TREE-BASED SEARCH;

ALGORITHMS; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; FORMAL LOGIC; INFORMATION ANALYSIS; OPTIMIZATION; PROBLEM SOLVING;

ARTIFICIAL INTELLIGENCE;

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

References (22)

1. Bayardo Jr., R. J. and Schrag, R. 1996. Using CSP look-back techniques to solve exceptionally hard SAT instances. In Proceedings of CP-96, 46-60.
2. Beame, P.; Kautz, H.; and Sabharwal, A. 2003. Understanding the power of clause learning. In Proceedings of UCAI-03, 1194-1201.
3. Cha, B., and Iwama, K. 1996. Adding new clauses for faster local search. In Proceedings of AMI-96, 332-337.
4. Eisenberg, C., and Fallings, B. 2003. Making the breakout algorithm complete using systematic search. In Proceedings of IJCAI-03, 1374-1375.
5. Garey, M. R., and Johnson, D. S. 1991. Computers and Intractability. New York: W.H. Freeman and Co.
6. Hirsh, E. A., and Kojevnikov, A. 2003. UnitWalk: A new SAT solver that uses local search guided by unit clause elimination. In Proceedings of SAT-02, 35-42.
7. Hoos, H. H., and Stützte, T. 2000. SATLIB: An online resource for resesarch on SAT. In Gent, I.; van Maaren, H.; and Walsh, T., eds., SAT 2000. IOS Press. 283-292.
8. Hoos, H. H. 1999. On the run-time behavior of stochastic local search algorithms for SAT. In AAAI-99, 661-666.
9. Hutter, F.; Tompkins, D. A. D.; and Hoos, H. H. 2002. Scaling and probabilistic smoothing: Efficient dynamic local search for SAT. In Proceedings of CP '02, 233-248.
10. Kautz, H., and Selman, B. 2003. Ten challenges redux: Recent progress in propositional reasoning and search. In Proceedings of CP '03, 1-18.
11. Mazure, B.; Saïs, L.; and Grégoire, E. 1998. Boosting complete techniques thanks to local search methods. Annals of Mathematics and Artificial Intelligence 22:319-331.
12. Morris, P. 1993. The breakout method for escaping from local minima. In Proceedings of AAAI-93, 40-45.
13. Moskewicz, M. W.; Madigan, C. F.; Zhao, Y; Zhang, L.; and Malik, S. 2001. Chaff: engineering an efficient SAT solver. In Proceedings of DAC-01, 530-535.
14. Richards, T., and Richards, B. 2000. Nonsystematic search and no-good learning. J. Auto. Reasoning 24(4):483-533.
15. Schuurmans, D.; Southey, F.; and Holte, R. C. 2001. The exponentiated subgradient algorithm for heuristic boolean programming. In Proceedings of IJCAI-01, 334-341.
16. Selman, B.; Kautz, H. A.; and Cohen, B. 1994. Noise strategies for improving local search. In AAAI-94, 337-343.
17. Selman, B.; Kautz, H.; and McAllester, D. 1995. Ten challenges in propositional reasoning and search. In Proceedings of IJCAI-95, 50-54.
18. Shang, Y., and Wah, B. W. 1997. A discrete Lagrangian-based global-search method for solving satisfiability problems. Journal of Global Optimization 10:1-40.
19. Simon, L. 2003. The SAT-03 contest results site. http://www.lri.fr/ ~simon/contest03/results/.
20. Wu, Z., and Wah, B. 2000. An efficient global-search strategy in discrete lagrangian methods for solving hard satisfiability problems. In Proceedings of AAAI-00, 310-315.
21. Yokoo, M. 1994. Weak-commitment search for solving constraint satisfaction problems. In Proc. AAAI-94, 313-318.
22. Yokoo, M. 1997. Why adding more constraints makes a problem easier for hill-climbing algorithms: Analyzing landscapes of CSPs. In Proceedings of CP-97, 356-370.