Local Restarts-Reference-Cited by-同舟云学术

Local Restarts

Published: Issue: Volume: Page:271-276
ISSN:
Container-title:Theory and Applications of Satisfiability Testing – SAT 2008
language:
Short-container-title:

Author:

Ryvchin Vadim,Strichman Ofer

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-79719-7_25.pdf

Reference8 articles.

1. A. Biere. PicoSAT essentials. JSAT (2008) (to be published)

2. Een, N., Sorensson, N.: Minisat v2.0 (beta). In: Solvers description, SAT-race (2006), http://fmv.jku.at/sat-race-2006/descriptions/27-minisat2.pdf

3. Gomes, C.P., Selman, B., Kautz, H.A.: Boosting combinatorial search through randomization. In: AAAI/IAAI, pp. 431–437 (1998)

4. Huang, J.: The effect of restarts on the efficiency of clause learning. In: IJCAI, pp. 2318–2323 (2007)

5. Luby, M., Sinclair, A., Zuckerman, D.: Optimal speedup of Las Vegas algorithms. In: ISTCS, pp. 128–133 (1993)

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

1. Unleashing the Potential of Restart by Detecting the Search Stagnation;Lecture Notes in Computer Science;2023

2. Leveraging GPUs for Effective Clause Sharing in Parallel SAT Solving;Theory and Applications of Satisfiability Testing – SAT 2021;2021

3. Between SAT and UNSAT: The Fundamental Difference in CDCL SAT;Lecture Notes in Computer Science;2015

4. Factoring Out Assumptions to Speed Up MUS Extraction;Theory and Applications of Satisfiability Testing – SAT 2013;2013

5. Parallel Tree Search for Satisfiability;Combinatorial Search: From Algorithms to Systems;2013