3 citations · 4 across the 3 of their papers we have counts for
Showing cs.AIShow all
2 papers · 1 filter
cs.AI2024★ 1 cited
IB-Net: Initial Branch Network for Variable Decision in Boolean Satisfiability
Tsz Ho Chan, Wenyi Xiao, Junhua Huang +3
Boolean Satisfiability problems are vital components in Electronic Design Automation, particularly within the Logic Equivalence Checking process. Currently, SAT solvers are employe…
cs.AI2023
Conflict-driven Structural Learning Towards Higher Coverage Rate in ATPG
Hui-Ling Zhen, Naixing Wang, Junhua Huang +3
Due to the increasing challenges posed by the relentless rise in the design complexity of integrated circuits, Boolean Satisfiability (SAT) has emerged as a robust alternative to s…