Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution-Reference-Cited by-同舟云学术

Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution

Published:2009 Issue: Volume: Page:114-127
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Atserias Albert,Fichte Johannes Klaus,Thurley Marc

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-02777-2_13

Reference16 articles.

1. Alekhnovich, M., Razborov, A.A.: Satisfiability, branch-width and tseitin tautologies. In: FOCS, pp. 593–603. IEEE Computer Society Press, Los Alamitos (2002)

2. Atserias, A., Dalmau, V.: A combinatorial characterization of resolution width. J. Comput. Syst. Sci. 74(3), 323–334 (2008)

3. Beame, P., Kautz, H.A., Sabharwal, A.: Understanding the power of clause learning. In: Gottlob, G., Walsh, T. (eds.) IJCAI, pp. 1194–1201. Morgan Kaufmann, San Francisco (2003)

4. Beame, P., Kautz, H.A., Sabharwal, A.: Towards understanding and harnessing the potential of clause learning. J. Artif. Intell. Res (JAIR) 22, 319–351 (2004)

5. Ben-Sasson, E., Wigderson, A.: Short proofs are narrow - resolution made simple. In: STOC, pp. 517–526 (1999)

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

1. Polynomial calculus for optimization;Artificial Intelligence;2024-12

2. Machine learning and logic: a new frontier in artificial intelligence;Formal Methods in System Design;2022-06

3. Chapter 4. Conflict-Driven Clause Learning SAT Solvers;Frontiers in Artificial Intelligence and Applications;2021-02-02

4. Centrality-Based Improvements to CDCL Heuristics;Theory and Applications of Satisfiability Testing – SAT 2018;2018

5. Machine Learning-Based Restart Policy for CDCL SAT Solvers;Theory and Applications of Satisfiability Testing – SAT 2018;2018