Integrating systematic and local search paradigms: A new strategy for MaxSAT

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2009, Pages 544-551

  Kroc, Lukas ^a   Sabharwal, Ashish ^a   Gomes, Carla P ^a   Selman, Bart ^a  

^a School of Operations Research and Information Engineering   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

LOCAL SEARCH (OPTIMIZATION); MEMORY ARCHITECTURE;

COMBINATORIAL PROBLEM; HYBRID SEARCH STRATEGIES; HYBRID STRATEGIES; INFORMATION COMMUNICATION; INFORMATION EXCHANGES; MAXIMUM SATISFIABILITY; MULTI-CORE PROCESSOR ARCHITECTURES; SYSTEMATIC SEARCHES;

HEURISTIC METHODS;

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

References (21)

1. J. Argelich, C. M. Li, F. Manyà, and J. Planes. Max-SAT Evaluation 2007, May 2007. http://www.maxsat07.udl.es.
2. A. Biere, M. J. H. Heule, H. van Maaren, and T. Walsh, editors. Handbook of Satisfiability, volume 185 of Frontiers in Artificial Intelligence and Applications. IOS Press, Feb 2009.
3. M. Davis and H. Putnam. A computing procedure for quantification theory. CACM, 7:201-215, 1960.
4. M. Davis, G. Logemann, and D. Loveland. A machine program for theorem proving. CACM, 5:394-397, 1962.
5. N. Eén and N. Sörensson. MiniSat: A SAT solver with conflict-clause minimization. In 8th SAT, St. Andrews, U.K., Jun 2005.
6. E. Grégoire, B. Mazure, and C. Piette. Boosting a complete technique to find MSS and MUS thanks to a local search oracle. In 20th IJCAI, pg. 2300-2305, Hyderabad, India, Jan 2007.
7. E. Grégoire, B. Mazure, and C. Piette. MUST: Provide a finer-grained explanation of unsatisfiability. In 13th CP, volume 4741 of LNCS, pg. 317-331, Providence, RI, Sep 2007.
8. E. A. Hirsch and A. Kojevnikov. UnitWalk: A new SAT solver that uses local search guided by unit clause elimination. Annals Math. and AI, 43(1):91-111, 2005.
9. H. H. Hoos and T. Stützle. Stochastic Local Search: Foundations and Applications. Morgan Kaufmann, San Francisco, CA, 2004.
10. F. Hutter, D. A. D. Tompkins, and H. H. Hoos. Scaling and probabilistic smoothing: Efficient dynamic local search for SAT. In 8th CP, volume 2470 of LNCS, pg. 233-248, Ithaca, NY, Sep 2002.
11. H. A. Kautz and B. Selman. BLACKBOX: A new approach to the application of theorem proving to problem solving. In Working notes of the Workshop on Planning as Combinatorial Search, held in conjunction with AIPS-98, Pittsburgh, PA, 1998.
12. L. Kroc, A. Sabharwal, and B. Selman. Relaxed DPLL search for MaxSAT. In 12th SAT, Swansea, Wales, U.K., Jun 2009. To appear.
13. C.M. Li, F. Manyà, and J. Planes. New inference rules for Max-SAT. JAIR, 30:321-359, 2007.
14. C. M. Li, W. Wei, and H. Zhang. Combining adaptive noise and look-ahead in local search for SAT. In 10th SAT, volume 4501 of LNCS, pg. 121-133, Lisbon, Portugal, May 2007.
15. J. P. Marques-Silva and V. M. Manquinho. Towards more effective unsatisfiability-based maximum satisfiability algorithms. In 11th SAT, volume 4996 of LNCS, pg. 225-230, Guangzhou, China, May 2008.
16. B. Mazure, L. Sais, and E. Grégoire. Boosting complete techniques thanks to local search methods. Annals Math. and AI, 22(3-4):319-331, 1998.
17. S. D. Prestwich. Variable dependency in local search: Prevention is better than cure. In 10th SAT, volume 4501 of LNCS, pg. 107-120, Lisbon, Portugal, May 2007.
18. B. Selman, H. Kautz, and B. Cohen. Local search strategies for satisfiability testing. In D. S. Johnson and M. A. Trick, editors, Cliques, Coloring and Satisfiability: the Second DIMACS Implementation Challenge, volume 26 of DIMACS Series in DMTCS, pg. 521-532. Amer. Math. Soc., 1996.
19. C. Sinz (Organizer). SAT-race 2008, May 2008. http://www-sr.informatik. uni-tuebingen.de/sat-race-2008.
20. D. A. D. Tompkins and H. H. Hoos. Scaling and probabilistic smoothing: Dynamic local search for unweighted MAX-SAT. In 16th Canadian Conf. on AI, volume 2671 of LNCS, pg. 145-159, Halifax, Canada, Jun 2003.
21. D. A. D. Tompkins and H. H. Hoos. UBCSAT: An implementation and experimentation environment for SLS algorithms for SAT and MAX-SAT. In 7th SAT, Vancouver, BC, May 2004. Solver description.