Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Chu Min Li
2010 – today
- 2012
[j14]Chu Min Li, Zhu Zhu, Felip Manyà, Laurent Simon: Optimizing with minimum satisfiability. Artif. Intell. 190: 32-44 (2012)
[c36]Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy, Chu Min Li: Analysis and Generation of Pseudo-Industrial MaxSAT Instances. CCIA 2012: 173-184
[c35]Carlos Ansótegui, Chu Min Li, Felip Manyà, Zhu Zhu: A SAT-Based Approach to MinSAT. CCIA 2012: 185-189
[c34]Zhu Zhu, Chu Min Li, Felip Manyà, Josep Argelich: A New Encoding from MinSAT into MaxSAT. CP 2012: 455-463
[c33]
[c32]Chu Min Li, Wanxia Wei, Yu Li: Exploiting Historical Relationships of Clauses and Variables in Local Search for Satisfiability - (Poster Presentation). SAT 2012: 479-480- 2011
[c31]Josep Argelich, Chu Min Li, Felip Manyà, Jordi Planes: Experimenting with the Instances of the MaxSAT Evaluation. CCIA 2011: 31-40
[c30]Chu Min Li, Zhu Zhu, Felip Manyà, Laurent Simon: Minimum Satisfiability and Its Applications. IJCAI 2011: 605-610
[c29]Josep Argelich, Chu Min Li, Felip Manyà, Jordi Planes: Analyzing the Instances of the MaxSAT Evaluation. SAT 2011: 360-361
[i1]- 2010
[j13]Chu Min Li, Felip Manyà, Nouredine Ould Mohamedou, Jordi Planes: Resolution-based lower bounds in MaxSAT. Constraints 15(4): 456-484 (2010)
[c28]
[c27]Chu Min Li, Zhe Quan: Combining Graph Structure Exploitation and Propositional Reasoning for the Maximum Clique Problem. ICTAI (1) 2010: 344-351
[c26]
2000 – 2009
- 2009
[c25]Chu Min Li, Felip Manyà, Nouredine Ould Mohamedou, Jordi Planes: Exploiting Cycle Structures in Max-SAT. SAT 2009: 467-480
[p1]Chu Min Li, Felip Manyà: MaxSAT, Hard and Soft Constraints. Handbook of Satisfiability 2009: 613-631- 2008
[j12]Josep Argelich, Chu Min Li, Felip Manyà, Jordi Planes: The First and Second Max-SAT Evaluations. JSAT 4(2-4): 251-278 (2008)
[j11]Ewald Speckenmeyer, Armando Tacchella, Vasco M. Manquinho, Chu Min Li: Guest Editors Conclusion. JSAT 4(2-4) (2008)
[j10]Wanxia Wei, Chu Min Li, Harry Zhang: A Switching Criterion for Intensification and Diversification in Local Search for SAT. JSAT 4(2-4): 219-237 (2008)
[c24]
[c23]Wanxia Wei, Chu Min Li, Harry Zhang: Switching among Non-Weighting, Clause Weighting, and Variable Weighting in Local Search for SAT. CP 2008: 313-326
[c22]Chu Min Li, Felip Manyà, Nouredine Ould Mohamedou, Jordi Planes: Transforming Inconsistent Subformulas in MaxSAT Lower Bound Computation. CP 2008: 582-587
[c21]- 2007
[j9]Carlos Ansótegui, Jose Larrubia, Chu Min Li, Felip Manyà: Exploiting multivalued knowledge in variable selection heuristics for SAT solvers. Ann. Math. Artif. Intell. 49(1-4): 191-205 (2007)
[j8]Chu Min Li, Felip Manyà, Jordi Planes: New Inference Rules for Max-SAT. J. Artif. Intell. Res. (JAIR) 30: 321-359 (2007)
[c20]Sylvain Darras, Gilles Dequen, Laure Devendeville, Chu Min Li: On Inconsistent Clause-Subsets for Max-SAT Solving. CP 2007: 225-240
[c19]Chu Min Li, Wanxia Wei, Harry Zhang: Combining Adaptive Noise and Look-Ahead in Local Search for SAT. SAT 2007: 121-133- 2006
[j7]Wen Qi Huang, Yu Li, Chu Min Li, Ru Chu Xu: New heuristics for packing unequal circles into a circular container. Computers & OR 33: 2125-2142 (2006)
[c18]Chu Min Li, Felip Manyà, Jordi Planes: Detecting Disjoint Inconsistent Subformulas for Computing Lower Bounds for Max-SAT. AAAI 2006: 86-91
[c17]Abdellah Idrissi, Chu Min Li, Jean Frédéric Myoupo: An Algorithm for a Constraint Optimization Problem in Mobile Ad-hoc Networks. ICTAI 2006: 555-562
[c16]Josep Argelich, Xavier Domingo, Chu Min Li, Felip Manyà, Jordi Planes: Towards Solving Many-Valued MaxSAT. ISMVL 2006: 26
[c15]Abdellah Idrissi, Chu Min Li: Modeling and optimization of the capacity allocation problem with constraints. RIVF 2006: 107-116- 2005
[j6]Bernard Jurkowiak, Chu Min Li, Gil Utard: A Parallelization Scheme Based on Work Stealing for a Class of SAT Solvers. J. Autom. Reasoning 34(1): 73-101 (2005)
[c14]Chu Min Li, Felip Manyà, Jordi Planes: Exploiting Unit Propagation to Compute Lower Bounds in Branch and Bound Max-SAT Solvers. CP 2005: 403-414
[c13]Chu Min Li, Wen Qi Huang: Diversification and Determinism in Local Search for Satisfiability. SAT 2005: 158-172- 2003
[j5]Chu Min Li: Equivalent literal propagation in the DLL procedure. Discrete Applied Mathematics 130(2): 251-276 (2003)
[j4]Chu Min Li, Sylvain Gérard: On the limit of branching rules for hard random unsatisfiable 3-SAT. Discrete Applied Mathematics 130(2): 277-290 (2003)
[c12]Wen Qi Huang, Yu Li, Bernard Jurkowiak, Chu Min Li, Ru Chu Xu: A Two-Level Search Strategy for Packing Unequal Circles into a Circle Container. CP 2003: 868-872- 2002
[c11]Djamal Habet, Chu Min Li, Laure Devendeville, Michel Vasquez: A Hybrid Approach for SAT. CP 2002: 172-184
[c10]Hachemi Bennaceur, Chu Min Li: Characterizing SAT Problems with the Row Convexity Property. CP 2002: 720-725- 2001
[j3]Bernard Jurkowiak, Chu Min Li, Gil Utard: Parallelizing Satz Using Dynamic Workload Balancing. Electronic Notes in Discrete Mathematics 9: 174-189 (2001)- 2000
[j2]Chu Min Li: Equivalency reasoning to solve a class of hard SAT problems. Inf. Process. Lett. 76(1-2): 75-81 (2000)
[c9]
[c8]Chu Min Li, Sylvain Gérard: On the Limit of Branching Rules for Hard Random Unsatisfiable 3-SAT. ECAI 2000: 98-102
1990 – 1999
- 1999
[j1]Chu Min Li: A Constraint-Based Approach to Narrow Search Trees for Satisfiability. Inf. Process. Lett. 71(2): 75-80 (1999)- 1997
[c7]
[c6]Chu Min Li, Anbulagan: Heuristics Based on Unit Propagation for Satisfiability Problems. IJCAI (1) 1997: 366-371- 1995
[c5]- 1992
[c4]Chu Min Li, Paul Y. Gloess: Applying a unified object logic model to implement a strong and dynamic interface between Prolog and an OODBMS. BDA 1992: 280-
[c3]Chu Min Li, Paul Y. Gloess: Realizing an efficient and incremental access to an object oriented database with Prolog. JFPL 1992: 268-283
[c2]
[c1]Paul Y. Gloess, Y.-N. Huang, Chu Min Li, M.-A. Hernandez: On Boolean Feature Types. WSA 1992: 213-220
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2012-12-12 17:07 CET by the dblp team



