| Heuristics based on unit propagation for satisfiability problems CM Li, A Anbulagan Proceedings of the 15th international joint conference on Artifical …, 1997 | 566 | 1997 |
| MaxSAT, hard and soft constraints CM Li, F Manya Handbook of satisfiability, 903-927, 2021 | 339 | 2021 |
| New inference rules for Max-SAT CM Li, F Manya, J Planes Journal of Artificial Intelligence Research 30, 321-359, 2007 | 230 | 2007 |
| Look-ahead versus look-back for satisfiability problems CM Li, Anbulagan International Conference on Principles and Practice of Constraint …, 1997 | 223* | 1997 |
| Integrating equivalency reasoning into Davis-Putnam procedure CM Li AAAI/IAAI 2000, 291-296, 2000 | 207 | 2000 |
| Diversification and determinism in local search for satisfiability CM Li, WQ Huang Theory and Applications of Satisfiability Testing: 8th International …, 2005 | 182 | 2005 |
| Greedy algorithms for packing unequal circles into a rectangular container W Huang, Y Li, H Akeb, CM Li Journal of the Operational Research Society 56 (5), 539-548, 2005 | 165 | 2005 |
| An efficient branch-and-bound algorithm based on maxsat for the maximum clique problem CM Li, Z Quan Proceedings of the AAAI Conference on Artificial Intelligence 24 (1), 128-133, 2010 | 162 | 2010 |
| New heuristics for packing unequal circles into a circular container WQ Huang, Y Li, CM Li, RC Xu Computers & Operations Research 33 (8), 2125-2142, 2006 | 120 | 2006 |
| An effective learnt clause minimization approach for CDCL SAT solvers M Luo, CM Li, F Xiao, F Manya, Z Lü Proceedings of the 26th International Joint Conference on Artificial …, 2017 | 114 | 2017 |
| Exploiting unit propagation to compute lower bounds in branch and bound Max-SAT solvers CM Li, F Manya, J Planes International conference on principles and practice of constraint …, 2005 | 111 | 2005 |
| The first and second Max-SAT evaluations J Argelich, CM Li, F Manya, J Planes Journal on Satisfiability, Boolean Modeling and Computation 4 (2-4), 251-278, 2008 | 106 | 2008 |
| Combining MaxSAT reasoning and incremental upper bound for the maximum clique problem CM Li, Z Fang, K Xu 2013 IEEE 25th international conference on tools with artificial …, 2013 | 105 | 2013 |
| Exploiting cycle structures in Max-SAT CM Li, F Manya, N Mohamedou, J Planes International Conference on Theory and Applications of Satisfiability …, 2009 | 103 | 2009 |
| Combining adaptive noise and look-ahead in local search for SAT CM Li, W Wei, H Zhang Theory and Applications of Satisfiability Testing–SAT 2007: 10th …, 2007 | 100 | 2007 |
| Detecting disjoint inconsistent subformulas for computing lower bounds for Max-SAT CM Li, F Manya, J Planes AAAI 6, 86-91, 2006 | 97 | 2006 |
| On minimization of the number of branches in branch-and-bound algorithms for the maximum clique problem CM Li, H Jiang, F Manyà Computers & Operations Research 84, 1-15, 2017 | 92 | 2017 |
| An exact algorithm for the maximum weight clique problem in large graphs H Jiang, CM Li, F Manya Proceedings of the AAAI conference on artificial intelligence 31 (1), 2017 | 84 | 2017 |
| Parallelizing Satz using dynamic workload balancing B Jurkowiak, CM Li, G Utard Electronic Notes in Discrete Mathematics 9, 174-189, 2001 | 76 | 2001 |
| Within-problem Learning for Efficient Lower Bound Computation in Max-SAT Solving. H Lin, K Su, CM Li AAAI 8, 351-356, 2008 | 71 | 2008 |
Jordi PlanesUniversitat de LleidaE-mailová adresa ověřena na: udl.cat
