- O. Coudert and J. Madre,
  New Ideas for Solving Covering Problems,
  Design Automation Conference, pp. 641-646, 1995.

- O. Coudert,
  On Solving Covering Problems,
  Design Automation Conference, pp. 197-202, 1996.

- C. Pizzuti, Computing Prime Implicants by Integer Programming, 
  International Conference on Tools with Artificial Intelligence,
  November 1996.

- T. Villa, T. Kam, R. Brayton and A. Sangiovanni-Vincentelli,
  Explicit and Implicit Algorithms for Binate Covering Problems,
  IEEE Transactions on Computer Aided Design,
  vol. 16, 7, pp. 677-691, July, 1997.

- S. Liao and S. Devadas,
  Solving Covering Problems Using LPR-Based Lower Bounds,
  Proceedings of the ACM/IEEE Design Automation Conference,
  pp. 117-120, June, 1997. 

- V. Manquinho, P. Flores, J. Marques-Silva and A. Oliveira,
  Prime Implicant Computation Using Satisfiability Algorithms,
  International Conference on Tools with Artificial Intelligence,
  pp. 232-239, November 1997.

- V. Manquinho and J. Marques-Silva,
  On Using Satisfiability-Based Pruning Techniques in Covering Algorithms,
  Design Automation and Testing in Europe, pp. 356--363, March 2000.

- V. Manquinho and J. Marques-Silva,
  Search Pruning Conditions for Boolean Optimization,
  European Conference on Artificial Intelligence,
  pp. 130-107, August 2000.

- F. Aloul, A. Ramani, I. Markov and K. Sakallah,
  Generic ILP versus Specialized 0-1 ILP: An Update,
  International Conference on Computer-Aided Design,
  pp. 450-457, November 2002.