Chu Min Li

2008
36		Han Lin, Kaile Su, Chu Min Li: Within-problem Learning for Efficient Lower Bound Computation in Max-SAT Solving. AAAI 2008: 351-356
35	EE	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
34	EE	Chu Min Li, Felip Manyà, Nouredine Ould Mohamedou, Jordi Planes: Transforming Inconsistent Subformulas in MaxSAT Lower Bound Computation. CP 2008: 582-587
33	EE	Josep Argelich, Chu Min Li, Felip Manyà: A Preprocessor for Max-SAT Solvers. SAT 2008: 15-20
32	EE	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)
31	EE	Ewald Speckenmeyer, Armando Tacchella, Vasco Manquinho, Chu Min Li: Guest Editors Conclusion. JSAT 4(2-4): (2008)
30	EE	Josep Argelich, Chu Min Li, Felip Manyà, Jordi Planes: The First and Second Max-SAT Evaluations. JSAT 4(2-4): 251-278 (2008)
2007
29	EE	Sylvain Darras, Gilles Dequen, Laure Devendeville, Chu Min Li: On Inconsistent Clause-Subsets for Max-SAT Solving. CP 2007: 225-240
28	EE	Chu Min Li, Wanxia Wei, Harry Zhang: Combining Adaptive Noise and Look-Ahead in Local Search for SAT. SAT 2007: 121-133
27	EE	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)
26	EE	Chu Min Li, Felip Manyà, Jordi Planes: New Inference Rules for Max-SAT. J. Artif. Intell. Res. (JAIR) 30: 321-359 (2007)
2006
25		Chu Min Li, Felip Manyà, Jordi Planes: Detecting Disjoint Inconsistent Subformulas for Computing Lower Bounds for Max-SAT. AAAI 2006
24	EE	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
23	EE	Josep Argelich, Xavier Domingo, Chu Min Li, Felip Manyà, Jordi Planes: Towards Solving Many-Valued MaxSAT. ISMVL 2006: 26
22	EE	Abdellah Idrissi, Chu Min Li: Modeling and optimization of the capacity allocation problem with constraints. RIVF 2006: 107-116
21	EE	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)
2005
20	EE	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
19	EE	Chu Min Li, Wen Qi Huang: Diversification and Determinism in Local Search for Satisfiability. SAT 2005: 158-172
18	EE	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)
2003
17	EE	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
16	EE	Chu Min Li: Equivalent literal propagation in the DLL procedure. Discrete Applied Mathematics 130(2): 251-276 (2003)
15	EE	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)
2002
14	EE	Djamal Habet, Chu Min Li, Laure Devendeville, Michel Vasquez: A Hybrid Approach for SAT. CP 2002: 172-184
13	EE	Hachemi Bennaceur, Chu Min Li: Characterizing SAT Problems with the Row Convexity Property. CP 2002: 720-725
2001
12	EE	Bernard Jurkowiak, Chu Min Li, Gil Utard: Parallelizing Satz Using Dynamic Workload Balancing. Electronic Notes in Discrete Mathematics 9: 174-189 (2001)
2000
11		Chu Min Li: Integrating Equivalency Reasoning into Davis-Putnam Procedure. AAAI/IAAI 2000: 291-296
10		Chu Min Li, Sylvain Gérard: On the Limit of Branching Rules for Hard Random Unsatisfiable 3-SAT. ECAI 2000: 98-102
9	EE	Chu Min Li: Equivalency reasoning to solve a class of hard SAT problems. Inf. Process. Lett. 76(1-2): 75-81 (2000)
1999
8	EE	Chu Min Li: A Constraint-Based Approach to Narrow Search Trees for Satisfiability. Inf. Process. Lett. 71(2): 75-80 (1999)
1997
7		Chu Min Li, Anbulagan: Look-Ahead Versus Look-Back for Satisfiability Problems. CP 1997: 341-355
6		Chu Min Li, Anbulagan: Heuristics Based on Unit Propagation for Satisfiability Problems. IJCAI (1) 1997: 366-371
1995
5		Paul Y. Gloess, Miguel-Angel Oros, Chu Min Li: U-Log = datalog + constraints. JFPLC 1995: 369-372
1992
4		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-
3		Chu Min Li, Paul Y. Gloess: Realizing an efficient and incremental access to an object oriented database with Prolog. JFPL 1992: 268-283
2		Chu Min Li, Paul Y. Gloess: ProQuery: Logical Access to an OODB. PLILP 1992: 487-488
1		Paul Y. Gloess, Y.-N. Huang, Chu Min Li, M.-A. Hernandez: On Boolean Feature Types. WSA 1992: 213-220

Coauthor Index

1	Anbulagan	[6] [7]
2	Carlos Ansótegui	[27]
3	Josep Argelich	[23] [30] [33]
4	Hachemi Bennaceur	[13]
5	Sylvain Darras	[29]
6	Gilles Dequen	[29]
7	Laure Devendeville	[14] [29]
8	Xavier Domingo	[23]
9	Sylvain Gérard	[10] [15]
10	Paul Y. Gloess	[1] [2] [3] [4] [5]
11	Djamal Habet	[14]
12	M.-A. Hernandez	[1]
13	Wen Qi Huang	[17] [19] [21]
14	Y.-N. Huang	[1]
15	Abdellah Idrissi	[22] [24]
16	Bernard Jurkowiak	[12] [17] [18]
17	Jose Larrubia	[27]
18	Yu Li	[17] [21]
19	Han Lin	[36]
20	Vasco Manquinho	[31]
21	Felip Manyà	[20] [23] [25] [26] [27] [30] [33] [34]
22	Nouredine Ould Mohamedou	[34]
23	Jean Frédéric Myoupo	[24]
24	Miguel-Angel Oros	[5]
25	Jordi Planes	[20] [23] [25] [26] [30] [34]
26	Ewald Speckenmeyer	[31]
27	Kaile Su	[36]
28	Armando Tacchella	[31]
29	Gil Utard	[12] [18]
30	Michel Vasquez	[14]
31	Wanxia Wei	[28] [32] [35]
32	Ru Chu Xu	[17] [21]
33	Harry Zhang	[28] [32] [35]

Colors in the list of coauthors