Author:
Chew Leroy,Heule Marijn J. H.
Publisher
Springer International Publishing
Reference22 articles.
1. Biere, A.: CaDiCaL at the SAT Race 2019 (2019)
2. Buss, S., Thapen, N.: DRAT proofs, propagation redundancy, and extended resolution. In: International Conference on Theory and Applications of Satisfiability Testing. pp. 71–89. Springer (2019)
3. Crawford, J.M., Kearns, M.J., Schapire, R.E.: The minimal disagreement parity problem as a hard satisfiability problem (1994)
4. Davis, M., Putnam, H.: A computing procedure for quantification theory. Journal of the ACM 7, 210–215 (1960)
5. Han, C.S., Jiang, J.H.R.: When Boolean satisfiability meets Gaussian elimination in a simplex way. In: Madhusudan, P., Seshia, S.A. (eds.) Computer Aided Verification. pp. 410–426. Springer, Berlin, Heidelberg (2012)
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Generating Extended Resolution Proofs with a BDD-Based SAT Solver;ACM Transactions on Computational Logic;2023-07-25
2. TBUDDY: A Proof-Generating BDD Package;Form Comp Aid Design;2022
3. Clausal Proofs for Pseudo-Boolean Reasoning;Tools and Algorithms for the Construction and Analysis of Systems;2022
4. Chapter 9. Preprocessing in SAT Solving;Frontiers in Artificial Intelligence and Applications;2021-02-02
5. Non-clausal Redundancy Properties;Automated Deduction – CADE 28;2021