1. Armando, A., Mantovani, J., Platania, L.: Bounded model checking of software using smt solvers instead of sat solvers. International Journal on Software Tools for Technology Transfer (STTT) 11(1), 69–83 (2009)
2. Bailleux, O.: On the cnf encoding of cardinality constraints and beyond. CoRR abs/1012.3853 (2010)
3. Bailleux, O.: Boolvar/pb v1.0, a java library for translating pseudo-boolean constraints into cnf formulae. CoRR abs/1103.3954 (2011)
4. Lecture Notes in Computer Science;C.W. Barrett,2002
5. Bieganowski, J., Karatkevich, A.: Heuristics for thelen’s prime implicant method. Schedae Informaticae 14, 125–125 (2005)