The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Chu Min Li: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Chu Min Li
    Integrating Equivalency Reasoning into Davis-Putnam Procedure. [Citation Graph (0, 0)][DBLP]
    AAAI/IAAI, 2000, pp:291-296 [Conf]
  2. Chu-Min Li, Felip Manyà, Jordi Planes
    Detecting Disjoint Inconsistent Subformulas for Computing Lower Bounds for Max-SAT. [Citation Graph (0, 0)][DBLP]
    AAAI, 2006, pp:- [Conf]
  3. Chu Min Li, Paul Y. Gloess
    Applying a unified object logic model to implement a strong and dynamic interface between Prolog and an OODBMS. [Citation Graph (0, 0)][DBLP]
    BDA, 1992, pp:280-0 [Conf]
  4. Chu Min Li, Anbulagan
    Look-Ahead Versus Look-Back for Satisfiability Problems. [Citation Graph (0, 0)][DBLP]
    CP, 1997, pp:341-355 [Conf]
  5. Hachemi Bennaceur, Chu Min Li
    Characterizing SAT Problems with the Row Convexity Property. [Citation Graph (0, 0)][DBLP]
    CP, 2002, pp:720-725 [Conf]
  6. Djamal Habet, Chu Min Li, Laure Devendeville, Michel Vasquez
    A Hybrid Approach for SAT. [Citation Graph (0, 0)][DBLP]
    CP, 2002, pp:172-184 [Conf]
  7. 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. [Citation Graph (0, 0)][DBLP]
    CP, 2003, pp:868-872 [Conf]
  8. Chu Li, Felip Manyà, Jordi Planes
    Exploiting Unit Propagation to Compute Lower Bounds in Branch and Bound Max-SAT Solvers. [Citation Graph (0, 0)][DBLP]
    CP, 2005, pp:403-414 [Conf]
  9. Chu Min Li, Sylvain Gérard
    On the Limit of Branching Rules for Hard Random Unsatisfiable 3-SAT. [Citation Graph (0, 0)][DBLP]
    ECAI, 2000, pp:98-102 [Conf]
  10. Abdellah Idrissi, Chu Min Li, Jean Frédéric Myoupo
    An Algorithm for a Constraint Optimization Problem in Mobile Ad-hoc Networks. [Citation Graph (0, 0)][DBLP]
    ICTAI, 2006, pp:555-562 [Conf]
  11. Chu Min Li, Anbulagan
    Heuristics Based on Unit Propagation for Satisfiability Problems. [Citation Graph (0, 0)][DBLP]
    IJCAI (1), 1997, pp:366-371 [Conf]
  12. Josep Argelich, Xavier Domingo, Chu-Min Li, Felip Manyà, Jordi Planes
    Towards Solving Many-Valued MaxSAT. [Citation Graph (0, 0)][DBLP]
    ISMVL, 2006, pp:26- [Conf]
  13. Chu Min Li, Paul Y. Gloess
    Realizing an efficient and incremental access to an object oriented database with Prolog. [Citation Graph (0, 0)][DBLP]
    JFPL, 1992, pp:268-283 [Conf]
  14. Paul Y. Gloess, Miguel-Angel Oros, Chu Min Li
    U-Log = datalog + constraints. [Citation Graph (0, 0)][DBLP]
    JFPLC, 1995, pp:369-372 [Conf]
  15. Chu Min Li, Paul Y. Gloess
    ProQuery: Logical Access to an OODB. [Citation Graph (0, 0)][DBLP]
    PLILP, 1992, pp:487-488 [Conf]
  16. Paul Y. Gloess, Y.-N. Huang, Chu Min Li, M.-A. Hernandez
    On Boolean Feature Types. [Citation Graph (0, 0)][DBLP]
    WSA, 1992, pp:213-220 [Conf]
  17. Chu Min Li, Wen Qi Huang
    Diversification and Determinism in Local Search for Satisfiability. [Citation Graph (0, 0)][DBLP]
    SAT, 2005, pp:158-172 [Conf]
  18. Wen Qi Huang, Yu Li, Chu Min Li, Ru Chu Xu
    New heuristics for packing unequal circles into a circular container. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2006, v:33, n:, pp:2125-2142 [Journal]
  19. Chu Min Li
    Equivalent literal propagation in the DLL procedure. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:130, n:2, pp:251-276 [Journal]
  20. Chu Min Li, Sylvain Gérard
    On the limit of branching rules for hard random unsatisfiable 3-SAT. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:130, n:2, pp:277-290 [Journal]
  21. Chu Min Li
    Equivalency reasoning to solve a class of hard SAT problems. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2000, v:76, n:1-2, pp:75-81 [Journal]
  22. Chu Min Li
    A Constraint-Based Approach to Narrow Search Trees for Satisfiability. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1999, v:71, n:2, pp:75-80 [Journal]
  23. Bernard Jurkowiak, Chu Min Li, Gil Utard
    A Parallelization Scheme Based on Work Stealing for a Class of SAT Solvers. [Citation Graph (0, 0)][DBLP]
    J. Autom. Reasoning, 2005, v:34, n:1, pp:73-101 [Journal]
  24. Sylvain Darras, Gilles Dequen, Laure Devendeville, Chu Min Li
    On Inconsistent Clause-Subsets for Max-SAT Solving. [Citation Graph (0, 0)][DBLP]
    CP, 2007, pp:225-240 [Conf]
  25. Chu Min Li, Wanxia Wei, Harry Zhang
    Combining Adaptive Noise and Look-Ahead in Local Search for SAT. [Citation Graph (0, 0)][DBLP]
    SAT, 2007, pp:121-133 [Conf]
  26. Carlos Ansótegui, Jose Larrubia, Chu-Min Li, Felip Manyà
    Exploiting multivalued knowledge in variable selection heuristics for SAT solvers. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 2007, v:49, n:1-4, pp:191-205 [Journal]

  27. Within-problem Learning for Efficient Lower Bound Computation in Max-SAT Solving. [Citation Graph (, )][DBLP]


  28. An Efficient Branch-and-Bound Algorithm Based on MaxSAT for the Maximum Clique Problem. [Citation Graph (, )][DBLP]


  29. Switching among Non-Weighting, Clause Weighting, and Variable Weighting in Local Search for SAT. [Citation Graph (, )][DBLP]


  30. Transforming Inconsistent Subformulas in MaxSAT Lower Bound Computation. [Citation Graph (, )][DBLP]


  31. Modeling and optimization of the capacity allocation problem with constraints. [Citation Graph (, )][DBLP]


  32. A Preprocessor for Max-SAT Solvers. [Citation Graph (, )][DBLP]


  33. Exploiting Cycle Structures in Max-SAT. [Citation Graph (, )][DBLP]


  34. Exact MinSAT Solving. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.005secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002