| 2008 |
|---|
| 27 | EE | Josep Argelich,
Chu Min Li,
Felip Manyà:
A Preprocessor for Max-SAT Solvers.
SAT 2008: 15-20 |
| 2007 |
|---|
| 26 | EE | Sylvain Darras,
Gilles Dequen,
Laure Devendeville,
Chu Min Li:
On Inconsistent Clause-Subsets for Max-SAT Solving.
CP 2007: 225-240 |
| 25 | EE | Chu Min Li,
Wanxia Wei,
Harry Zhang:
Combining Adaptive Noise and Look-Ahead in Local Search for SAT.
SAT 2007: 121-133 |
| 24 | 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) |
| 23 | EE | Chu Min Li,
Felip Manyà,
Jordi Planes:
New Inference Rules for Max-SAT.
J. Artif. Intell. Res. (JAIR) 30: 321-359 (2007) |
| 2006 |
|---|
| 22 | | Chu Min Li,
Felip Manyà,
Jordi Planes:
Detecting Disjoint Inconsistent Subformulas for Computing Lower Bounds for Max-SAT.
AAAI 2006 |
| 21 | 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 |
| 20 | EE | Josep Argelich,
Xavier Domingo,
Chu Min Li,
Felip Manyà,
Jordi Planes:
Towards Solving Many-Valued MaxSAT.
ISMVL 2006: 26 |
| 19 | 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 |
|---|
| 18 | EE | Chu Min Li,
Wen Qi Huang:
Diversification and Determinism in Local Search for Satisfiability.
SAT 2005: 158-172 |
| 17 | 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 |
|---|
| 16 | 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 |
| 15 | EE | Chu Min Li:
Equivalent literal propagation in the DLL procedure.
Discrete Applied Mathematics 130(2): 251-276 (2003) |
| 14 | 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 |
|---|
| 13 | EE | Djamal Habet,
Chu Min Li,
Laure Devendeville,
Michel Vasquez:
A Hybrid Approach for SAT.
CP 2002: 172-184 |
| 12 | EE | Hachemi Bennaceur,
Chu Min Li:
Characterizing SAT Problems with the Row Convexity Property.
CP 2002: 720-725 |
| 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 |
