Another complete local search method for SAT

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

Volumn 3835 LNAI, Issue , 2005, Pages 595-605

  Shen, Haiou ^a   Zhang, Hantao ^a  

^a University of Iowa   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DATABASE SYSTEMS; FUNCTION EVALUATION; OPTIMAL CONTROL SYSTEMS; PROBLEM SOLVING; SEARCH ENGINES;

COMBINATORIAL PROBLEMS; GRADIENT FUNCTION; LOCAL SEARCH ALGORITHMS;

COMBINATORIAL MATHEMATICS;

EID: 33745465777     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11591191_41     Document Type: Conference Paper

References (19)

1. [BG2002] Bachmair, L., Ganzinger, H.: Resolution theorem proving, in A. Robinson, and A. Voronkov, editors, The Hanfbook of Automated Reasoning, chapter 2, volume I, 19-99. Elsevier Science Pub, 2001.
2. [B2003] Beame, P., Kautz, H., Sabharwal, A.: Understanding the power of clause learning. In Proceedings of IJCAI-03, pages 1194-1201, 2003.
3. [CI1996] Cha, B., Iwama, K.: Adding new clauses for faster local search. In Proceedings of AAAI-96, pages 332-337, 1996.
4. [DP1960] Davis, M., Putnam, H. A computing procedure for quantification theory. Journal of the ACM, 7, 201-215, 1960.
5. [DLL1962] Davis, M., Logemann, G., Loveland, D.: A machine program for theorem proving. Journal of the ACM, 5(7): 394-397, 1962.
6. [FR2004] Fang, H., Ruml, W.: Complete Local Search for Prepositional Satisfiability. Proc. of 19th National Conference on Artificial Intelligence, 2004, pages 161-166.
7. [GN2002] Boldberg, E., Novikov, Y: BerkMin: a Fast and Robust SAT-Solver. Proc. of DATE2002, 2002, pages 142-149.
8. [HS2000] Hoos, H.H., Stützle, T.: SATLIB: An Online Resource for Research on SAT. In: I.P. Gent, H.V. Maaren, T. Walsh, editor, SAT 2000, pages 283-292, IOS Press. SATLIB is available online at www.satlib.org.
9. [HS2005] Hoos, H.H., Stützle, T: Stochastic Local Search: Foundations and Applications. Morgan Kaufmann Publishers, San Francisco, CA, USA, 2005.
10. [KS2003] Kautz, H., Selman, B.: Ten challenges redux: Recent progress in propositional reasoning and search. Proc. of CPO3, pages 1-18, 2003.
11. [MS1999] J.P. Marques-Silva and K.A. Sakallah, GRASP: A search algorithm for propositional satisfiability, IEEE Trans. Comput. 48(5):506-520, May 1999.
12. [M1993] Morris, P.: The breakout method for escaping from local minima. In Proceedings of AAAI-93, pages 40-45, 1993.
13. [M2001] Moskewicz, M., Madigan, C., Zhao, Y., Zhang, L., Malik, S.: Chaff: Engineering an Efficient SAT Solver. Proc. of Design Automation Conference, pages 530-535, 2001.
14. [N2002] Nadel, A.: Backtrack Search Algorithms for Prepositional Logic Satisfiability: Review and Innovations. Thesis of Nadel, A. 2002.
15. [SKM1995] Selman, B., Kautz, H., McAllester, D.: Ten challenges in prepositional reasoning and search. Proe. of IJCAI-95, pages 50-54, 1995.
16. [SW1997] Shang, Y., Wah, B.W.: A discrete Lagrangian-based global-search method for solving satisfiability problems. Journal of Global Optimization 10:1-40 1997
17. [WW2000] Wu, Z., Wah, B.W.: An efficient global-search strategy in discrete Lagrangian methods for solving hard satisfiability problems. In Proceedings of AAAI-00, 310-315, 2000.
18. [Y1997] Yokoo, M.: Why adding more constraints makes a problem easier for hill-climbing algorithms: Analyzing landscapes of CSPs. In Proceedings of CP-97, pages 356-370, 1997.
19. [Z1997] Zhang, H.: SATO: An efficient prepositional prover, Proc. of International Conference on Automated Deduction (CADE-97), pages 308-312, Lecture Notes in Artificial Intelligence 1104, Springer-Verlag, 1997.