Boosting Local Search Thanks to cdcl-Reference-Cited by-同舟云学术

Boosting Local Search Thanks to cdcl

Published:2010 Issue: Volume: Page:474-488
ISSN:0302-9743
Container-title:Logic for Programming, Artificial Intelligence, and Reasoning
language:
Short-container-title:

Author:

Audemard Gilles,Lagniez Jean-Marie,Mazure Bertrand,Saïs Lakhdar

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-16242-8_34

Reference38 articles.

1. Audemard, G., Simon, L.: Predicting learnt clauses quality in modern SAT solvers. In: Proceedings of International Joint Conference on Artificial Intelligence, pp. 399–404 (2009)

2. Lecture Notes in Computer Science;A. Balint,2009

3. Biere, A.: PicoSAT essentials. Journal on Satisfiability 4, 75–97 (2008)

4. Frontiers in Artificial Intelligence and Applications,2009

5. Crawford, J.: Solving satisfiability problems using a combination of systematic and local search. In: Second Challenge on Satisfiability Testing organized by Center for Discrete Mathematics and Computer Science of Rutgers University (1996)

Cited by 9 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Improving local search for the weighted sum coloring problem using the branch-and-bound algorithm;Knowledge-Based Systems;2022-06

2. Deep Cooperation of CDCL and Local Search for SAT;Theory and Applications of Satisfiability Testing – SAT 2021;2021

3. On the Effect of Learned Clauses on Stochastic Local Search;Theory and Applications of Satisfiability Testing – SAT 2020;2020

4. Constraint-Based Techniques in Stochastic Local Search MaxSAT Solving;Lecture Notes in Computer Science;2019

5. Boosting MUC extraction in unsatisfiable constraint networks;Applied Intelligence;2014-06-26