1. Alekhnovich, M., Buss, S.R., Moran, S., Pitassi, T.: Minimum propositional proof length is NP-hard to linearly approximate. J. Symb. Log. 66(1), 171–191 (2001)
2. Lecture Notes in Computer Science;MF Arif,2015
3. Asín, R., Nieuwenhuis, R., Oliveras, A., Rodríguez-Carbonell, E.: Cardinality networks: a theoretical and empirical study. Constraints 16(2), 195–221 (2011)
4. Audemard, G., Simon, L.: GUNSAT: A greedy local search algorithm for unsatisfiability. In: IJCAI, pp. 2256–2261 (2007)
5. Bacchus, F., Davies, J., Tsimpoukelli, M., Katsirelos, G.: Relaxation search: a simple way of managing optional clauses. In: AAAI, pp. 835–841 (2014)