Citation: google scholar, citeseer, ACM Guide

Peer reviewed journal papers

Josep Argelich, Chu Min LI, Felip Manya, Jordi Planes, "The First and Second Max-SAT Evaluations", In Journal on Satisfiability, Boolean Modeling and Computation (JSAT), Volume 4 (2008), pages 251- 278.

Wanxia Wei, Chu Min LI, Harry Zhang, "A Switching Criterion for Intensification and Diversification in Local Search for SAT", In Journal on Satisfiability, Boolean Modeling and Computation (JSAT), Volume 4 (2008), pages 219-237.

Chu Min LI, Felip Manya,  Jordi Planes, "New Inference Rules for Max-SAT", in Journal of Artificial Intelligence Research, October 2007, Volume 30, pages 321-359

WenQi HUANG, Yu LI, ChuMin LI, RuChu XU, "New Heuristics for Packing Unequal Circles into a Circular Container",  in Computers & operations research (Vol 33, Issue 8, August 2006, Pages 2125-2142).

Bernard Jurkowiak, Chu Min LI, and Gil Utard, "A parallelization scheme based on work stealing for a class of SAT solvers", in Journal of Automated Reasoning (2005) 34:73-101.

WenQi Huang, Yu LI, Kakim Akeb, Chu Min LI, ``Greedy algorithms for packing unequal circles into a rectangular container'', in Journal of the Operational Research Society (JORS), May 2005, Volume 56, Number 5,  Page 539-548.

Chu Min LI,  Sylvain Gérard, ``On the Limit of Branching Rules for Hard Random Unsatisfiable 3-SAT'', in Discrete Applied
Mathematics, Vol 130/2, pp 277-290, 2003.

Chu Min LI, ``Equivalent literal propagation in Davis-Putnam procedure'', in Discrete Applied Mathematics, Vol 130/2 pp 251-276, 2003.

Chu Min LI, ``Equivalency reasoning to solve a class of hard SAT problems'',  Information Processing Letters 76 (2000) pages 75-81.

Chu Min LI, ``A constrained-based approach to narrow search trees for satisfiability'', Information Processing Letters 71(1999) pages 75-80.

Chu Min LI, ``La Propagation de Contraintes et la Procédure DPLL pour le Raisonnement Propositionnel'', Compte rendu d'habilitation, Technique et Scien ce Informatique, volume 20-N°6/2001, pages 821-823.


Peer reviewed conference papers

Chu Min LI, Felip Manya,  Nouredine Mohamedou, Jordi Planes, "Exploiting Cycle Structures in Max-SAT". In proceedings of 12th international conference on the Theory and Applications of Satisfiability Testing (SAT2009), Springer, LNCS 5584, pages 467-480, June-July 2009, Swansea, United Kindom.

W. Wei, C. M. Li, and H. Zhang. "Switching Among Non-Weighting, Clause Weighting, and Variable Weighting in Local Search for SAT". In Proceedings of 14th international conference on Principles  and Practice of Constraint Programming (CP-2008), pages 313–326. Springer, LNCS 5202, Sydney, 2008.

Josep Argelich, Chu Min LI, Felip Manya, "A Preprocessor for Max-SAT Solvers", in proceedings of the Eleventh International Conference on Theory and Applications of Satisfiability Testing (SAT2008), Springer Verlag, LNCS 4996, pages 15-20, Guanzhou, China, May 2008

Han Lin, Kaile Su, Chu-Min Li, "Within-problem Learning for Efficient Lower Bound Computation in Max-SAT Solving", In Proceedings of the 23rd National Conference on Artificial Intel ligence (AAAI-08), Chicago, USA, pp. 351-356. AAAI Press.

Sylvain Darras, Gilles Dequen, Laure Devendeville, Chu Min LI, "On Inconsistent Clause-Subsets for Max-SAT Solving".  In proceedings of 13th international conference on Principles and Practice of Constraint Programming (CP 2007), Spring, LNCS 4741, pages 225-240, Providence, USA, October 2007.

Chu Min Li, Wanxia Wei, Harry Zhang, "Combining Adaptive Noise and Look-Ahead in Local Search for SAT". In proceedings of 10th international conference on the Theory and Applications of Satisfiability Testing (SAT2007), Springer, LNCS 4501, Pages 121-133, Lisbon, Portugal, May 2007.

Chu Min LI, Felip Manya,  Jordi Planes,  "Detecting disjoint inconsistent subformulas for  computing lower bounds for Max-SAT". In Proceedings of the 21st National Conference on Artificial Intel ligence (AAAI-06), Boston, USA, pp. 86–91. AAAI Press.

Chu Min LI, Felip Manya and Jordi Planes, "Exploiting unit propagation to compute lower bounds in
branch and bound MaxSAT solvers", in proceedings of 11st international conference on Principles  and Practice of Constraint Programming (CP 2005), LNCS 3709, Pages 403-414, Springer, Sitges, Spain, October 2005.

Chu Min LI and Wenqi Huang, "Diversification and Determinism in Local search for Satisfiability", in proceedings of 8th international conference on the Theory and Applications of Satisfiability Testing (SAT2005), LNCS 3569 Springer, St Andrews, UK, June 2005, Pages 158-172

Wen Qi Huang, Yu LI, Bernard Jurkowiak, Chu Min LI and Ru Chu Xu, ``A Two-Level Search
Strategy for Packing Unequal Circles into a Circle Container'', in proceedings of the 9th International Conference on Principles and Practice of Constraint Programming (CP 2003), Springer-Verlag, Kinsale, Ireland, September 29-October 3, 2003, pp. 868-872.

Ansótegui C., Larrubia J., Chu Min LI, Manyà F. "Mv-Satz: A SAT Solver for Many-valued Clausal forms", in proceedings of the Fourth International Conference Journées de l'Informatique Messine(JIM'2003), September 3-6, 2003, Metz, France.

Bennaceur H.,  Chu Min LI, ``Characterizing SAT Problems with the Row Convexity Property", in proceedings of Eighth International Conference on Principles and Practice of  Constraint Programming (CP2002), Cornell University, Ithaca, NY, USA, Pages 720-725,  septembre 2002.

Habet D., Chu Min LI, Devendeville L., Vasquez M., ``A Hybrid Approach for SAT", in proceedings of Eighth International Conference on Principles and Practice of Constraint Programming (CP2002), Cornell University, Ithaca, NY, USA, Pages 172-184, septembre 2002.

Carlos Ansotegui, Ramon Bejar,  Alba Cabiscol, Chu Min LI et Felip Manya, ``Resolution Methods for Many-Valued CNF Formulas", in proceedings of Fifth International Symposium on the Theory and Applications of Satisfiability Testing (SAT'2002), pages 156-163, Cincinnati, Ohio, USA, 6-9 mai 2002.

Chu Min LI, Bernard Jurkowiak, Paul W. Purdom Jr, ``Integrating symmetry breaking into a DLL procedure", in proceedings of Fifth International Symposium on the Theory and Applications of Satisfiability Testing (SAT'2002), pages 149-155, Cincinnati, Ohio, USA, 6-9 mai 2002.

Hachemi Bennaceur, Chu Min LI, ``An Empirical Measure for Characterizing 3-SAT", in proceedings of Fifth International Symposium on the Theory and Applications of Satisfiability Testing (SAT'2002), pages 201-205, Cincinnati, Ohio, USA, 6-9 mai 2002.

Chu Min LI, ``Integrating Equivalency reasoning into Davis-Putnam procedure", in proceedings of the 17th National Conference on Artificial Intelligence (AAAI-2000), Pages 291-296, Austin Texas, USA, 2000.

Chu Min LI, Sylvain Gérard, ``On the Limit of Branching Rules for Hard Random Unsatisfiable 3-SAT'', in proceedings of the 14th European Conference on Artificial Intelligence (ECAI-2000), IOS Press,  Pages 98-102, Berlin, 2000.

Chu Min LI, Anbulagan, ``Look-ahead versus look-back for satisfiability problems",  in proceedings of the third international conference on Principles and Practice of Constraint Programming--CP97, Springer-Verlag, LNCS 1330, Pages 342-356, Autriche, 1997.

Chu Min LI, Anbulagan, ``Heuristics based on unit propagation for satisfiability problems",  in proceedings of the 15th International Joint Conference on Artificial Intelligence (IJCAI'97),  Morgan Kaufmann Publishers, ISBN 1-55860-480-4, Pages 366-371, Japon, 1997.


Workshop papers

Marc-Antoine Boryczka, Yu LI, Wenqi Huang, Chu Min LI, ``A Generator of Instances for Circle Packing Problems",  in the proceedings of International Workshop on Heuristics, 24-27 July 2002, Beijing, China.

WenQi Huang, Yu LI, Sylvain Gérard, Chu Min LI, Xu RuChu, ``A learning from human heuristic for solving unequal disks packing problem", in the proceedings of International Workshop on Heuristics, 24-27 July 2002, Beijing, China.

Bernard Jurkowiak, Chu Min LI, Gil Utard, ``Parallelizing Satz Using Dynamic Workload Balancing'', in the proceedings of Workshop on Theory and Applications of Satisfiability Testing (SAT'2001), pages 205--211, Boston, 14-15 juin 2001.