2 papers
cs.LO2026
Rethinking Clause Management for CDCL SAT Solvers
Yalun Cai, Xindi Zhang, Zhengyuan Shi +2
Boolean Satisfiability (SAT) solving underpins a wide range of applications in Electronic Design Automation (EDA), particularly formal verification. However, this paper observes th…
cs.AI2025
Circuit-Aware SAT Solving: Guiding CDCL via Conditional Probabilities
Jiaying Zhu, Ziyang Zheng, Zhengyuan Shi +2
Circuit Satisfiability (CSAT) plays a pivotal role in Electronic Design Automation. The standard workflow for solving CSAT problems converts circuits into Conjunctive Normal Form (…