5 citations · 7 across the 4 of their papers we have counts for
1 paper · 1 filter
Tero Laitinen, Tommi Junttila, Ilkka Niemelä
Propositional satisfiability (SAT) solvers, which typically operate using conjunctive normal form (CNF), have been successfully applied in many domains. However, in some applicatio…