5 citations · 7 across the 4 of their papers we have counts for
Showing 2014Show all
2 papers · 1 filter
cs.LO2014★ 1 cited
Conflict-Driven XOR-Clause Learning (extended version)
Tero Laitinen, Tommi Junttila, Ilkka Niemelä
Modern conflict-driven clause learning (CDCL) SAT solvers are very good in solving conjunctive normal form (CNF) formulas. However, some application problems involve lots of parity…
cs.LO2014
Classifying and Propagating Parity Constraints (extended version)
Tero Laitinen, Tommi Junttila, Ilkka Niemelä
Parity constraints, common in application domains such as circuit verification, bounded model checking, and logical cryptanalysis, are not necessarily most efficiently solved if tr…