A survey of SAT solver-Reference-Cited by-同舟云学术

A survey of SAT solver

Published:2017 Issue: Volume: Page:
ISSN:0094-243X
Container-title:AIP Conference Proceedings
language:
Short-container-title:

Author:

Gong Weiwei,Zhou Xu

Publisher

Author(s)

Link

http://aip.scitation.org/doi/pdf/10.1063/1.4981999

Reference63 articles.

1. G. Tassey, National Institute of Standards and Technology, RTI Project 7007 (2002).

2. A machine program for theorem-proving

3. J. P. M. Silva and K. A. Sakallah, “Graspła new search algorithm for satisfiability,” in Proceedings of the 1996 IEEE/ACM international conference on Computer-aided design (IEEE Computer Society, 1997), pp. 220–227.

4. N. Eén and N. Sörensson, Springer Berlin/Heidelberg 10, 978–3 (2004).

5. M. W. Moskewicz, C. F. Madigan, Y. Zhao, L. Zhang, and S. Malik, “Chaff: Engineering an efficient sat solver,” in Proceedings of the 38th annual Design Automation Conference (ACM, 2001), pp. 530–535.

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

1. Accelerating Boolean Constraint Propagation for Efficient SAT-Solving on FPGAs;Proceedings of the Great Lakes Symposium on VLSI 2024;2024-06-12

2. Dynamics of Bipartite Logical Networks;2024 47th MIPRO ICT and Electronics Convention (MIPRO);2024-05-20

3. On the Existence of Unknown Rearrangeable Banyan-type Networks;Proceedings of the 2023 6th International Conference on Electronics, Communications and Control Engineering;2023-03-24

4. Approaches to Overpower Proof-of-Work Blockchains Despite Minority;IEEE Access;2023

5. MLFM: Machine Learning Meets Formal Method for Faster Identification of Security Breaches in Network Functions Virtualization (NFV);Computer Security – ESORICS 2022;2022