Chu Min Li

发表

Heuristics Based on Unit Propagation for Satisfiability Problems

Chu Min Li, Anbulagan, Chu Min Li, 1997, IJCAI.

Analyzing the Instances of the MaxSAT Evaluation

Josep Argelich, Felip Manyà, Chu Min Li, 2011, SAT.

Parallelizing Satz Using Dynamic Workload Balancing

Gil Utard, Chu Min Li, Chu Min Li, 2001, Electron. Notes Discret. Math..

A SAT-Based Approach to MinSAT

Zhu Zhu, Carlos Ansótegui, Felip Manyà, 2012, CCIA.

A Clause Tableau Calculus for MinSAT

Felip Manyà, Chu Min Li, Joan Ramon Soler, 2016, CCIA.

Exploiting Many-Valued Variables in MaxSAT

Josep Argelich, Felip Manyà, Chu Min Li, 2017, 2017 IEEE 47th International Symposium on Multiple-Valued Logic (ISMVL).

An Exact Algorithm for the Maximum Weight Clique Problem in Large Graphs

Hua Jiang, Felip Manyà, Chu Min Li, 2017, AAAI.

Solving Maximum Weight Clique Using Maximum Satisfiability Reasoning

Ke Xu, Chu Min Li, Zhiwen Fang, 2014, ECAI.

On Reducing Clause DataBase in Glucose

Fan Xiao, Chu Min Li, Chu Min Li, 2016, IWIL@LPAR.

Exploiting Cycle Structures in Max-SAT

Felip Manyà, Chu Min Li, Jordi Planes, 2009, SAT.

Optimizing with minimum satisfiability

Zhu Zhu, Felip Manyà, Chu Min Li, 2012, Artif. Intell..

A New Encoding from MinSAT into MaxSAT

Josep Argelich, Zhu Zhu, Felip Manyà, 2012, CP.

An Algorithm for a Constraint Optimization Problem in Mobile Ad-hoc Networks

Abdellah Idrissi, Chu Min Li, Chu Min Li, 2006, 2006 18th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'06).

A Two-Level Search Strategy for Packing Unequal Circles into a Circle Container

Yu Li, Chu Min Li, Chu Min Li, 2003, CP.

A new upper bound for the maximum weight clique problem

Yu Li, Hua Jiang, Felip Manyà, 2018, Eur. J. Oper. Res..

Combining Graph Structure Exploitation and Propositional Reasoning for the Maximum Clique Problem

Chu Min Li, Chu Min Li, Zhe Quan, 2010, 2010 22nd IEEE International Conference on Tools with Artificial Intelligence.

The Scientist's Expert Assistant Simulation Facility

David Matusow, Chu Min Li, Anuradha Purushottam Koratkar, 2001 .

A resolution calculus for MinSAT

Felip Manyà, Chu Min Li, Fan Xiao, 2019 .

ProQuery: Logical Access to an OODB

Chu Min Li, Paul Y. Gloess, 1992, PLILP.

Resolution-based lower bounds in MaxSAT

Felip Manyà, Chu Min Li, Jordi Planes, 2010, Constraints.

A Two-Individual Based Evolutionary Algorithm for the Flexible Job Shop Scheduling Problem

Zhipeng Lü, Fred Glover, Liping Xu, 2019, AAAI.

Minimum Satisfiability and Its Applications

Zhu Zhu, Felip Manyà, Chu Min Li, 2011, IJCAI.

Exploiting Unit Propagation to Compute Lower Bounds in Branch and Bound Max-SAT Solvers

Felip Manyà, Chu Min Li, Jordi Planes, 2005, CP.

Combining Adaptive Noise and Look-Ahead in Local Search for SAT

Harry Zhang, Chu Min Li, Chu Min Li, 2007, SAT.

Combining MaxSAT Reasoning and Incremental Upper Bound for the Maximum Clique Problem

Ke Xu, Chu Min Li, Zhiwen Fang, 2013, ICTAI.

Transforming Inconsistent Subformulas in MaxSAT Lower Bound Computation

Felip Manyà, Chu Min Li, Jordi Planes, 2008, CP.

A Parallelization Scheme Based on Work Stealing for a Class of SAT Solvers

Gil Utard, Chu Min Li, Chu Min Li, 2005, Journal of Automated Reasoning.

A Preprocessor for Max-SAT Solvers

Josep Argelich, Felip Manyà, Chu Min Li, 2008, SAT.

14. Combining Adaptive Noise and Look-Ahead in Local Search for SAT

Harry Zhang, Chu Min Li, Wanxia Wei, 2010 .

New Lower Bound for the Minimum Sum Coloring Problem

Chu Min Li, Corinne Lucet, Clément Lecat, 2017, AAAI.

Switching among Non-Weighting, Clause Weighting, and Variable Weighting in Local Search for SAT

Harry Zhang, Chu Min Li, Chu Min Li, 2008, CP.

Experimenting with the Instances of the MaxSAT Evaluation

Josep Argelich, Felip Manyà, Chu Min Li, 2011, CCIA.

A Two-Stage MaxSAT Reasoning Approach for the Maximum Weight Clique Problem

Hua Jiang, Yanli Liu, Felip Manyà, 2018, AAAI.

Guest Editors Conclusion

Vasco M. Manquinho, Armando Tacchella, Ewald Speckenmeyer, 2008, J. Satisf. Boolean Model. Comput..

On minimization of the number of branches in branch-and-bound algorithms for the maximum clique problem

Hua Jiang, Felip Manyà, Chu Min Li, 2017, Comput. Oper. Res..

Particle and fluid models for streamers : comparison and spatial coupling

Chu Min Li, Wjm Wouter Brok, Ute Ebert, 2007 .

An efficient branch-and-bound algorithm based on MaxSAT for the maximum clique problem

Chu Min Li, Chu Min Li, Zhe Quan, 2010, AAAI 2010.

Discrete Frame-Based Gaussian Beam Methods for Seismic Modeling and Imaging

Chu Min Li, Robert L. Nowack, 2004 .

Minimum sum coloring problem: Upper bounds for the chromatic strength

Chu Min Li, Corinne Lucet, Clément Lecat, 2017, Discret. Appl. Math..

An Effective Variable Neighborhood Search with Perturbation for Location-Routing Problem

Chu Min Li, Hua Jiang, Corinne Lucet, 2019, Int. J. Artif. Intell. Tools.

Local search for diversified Top-k clique search problem

Jun Wu, Chu Min Li, Minghao Yin, 2020, Comput. Oper. Res..

The First and Second Max-SAT Evaluations

Josep Argelich, Felip Manyà, Chu Min Li, 2008, J. Satisf. Boolean Model. Comput..

New Inference Rules for Max-SAT pdf

Felip Manyà, Chu Min Li, Jordi Planes, 2007, J. Artif. Intell. Res..

MinSAT versus MaxSAT for Optimization Problems

Josep Argelich, Zhu Zhu, Felip Manyà, 2013, CP.

On the limit of branching rules for hard random unsatisfiable 3-SAT

Chu Min Li, Sylvain Gérard, 2003, Discret. Appl. Math..

A Switching Criterion for Intensification and Diversification in Local Search for SAT

Harry Zhang, Chu Min Li, Chu Min Li, 2008, J. Satisf. Boolean Model. Comput..

Equivalent literal propagation in the DLL procedure

Chu Min Li, Chu Min Li, 2003, Discret. Appl. Math..

Incremental MaxSAT Reasoning to Reduce Branches in a Branch-and-Bound Algorithm for MaxClique

Hua Jiang, Chu Min Li, Ruchu Xu, 2015, LION.

Modeling and optimization of the capacity allocation problem with constraints

Abdellah Idrissi, Chu Min Li, 2006, 2006 International Conference onResearch, Innovation and Vision for the Future.

An Iterative Path-Breaking Approach with Mutation and Restart Strategies for the MAX-SAT Problem

Kun He, Chu Min Li, Chu Min Li, 2018, Comput. Oper. Res..

An Exact Algorithm Based on MaxSAT Reasoning for the Maximum Weight Clique Problem

Ke Xu, Chu Min Li, Chu Min Li, 2016, J. Artif. Intell. Res..

Clause Vivification by Unit Propagation in CDCL SAT Solvers

Fan Xiao, Yu Li, Zhipeng Lü, 2020, Artif. Intell..

MaxSAT, Hard and Soft Constraints

Felip Manyà, Chu Min Li, Chu Min Li, 2021, Handbook of Satisfiability.

Realizing an efficient and incremental access to an object oriented database with Prolog

Chu Min Li, Paul Y. Gloess, 1992, JFPL.

On Inconsistent Clause-Subsets for Max-SAT Solving

Gilles Dequen, Chu Min Li, Chu Min Li, 2007, CP.

U-Log = datalog + constraints

Chu Min Li, Paul Y. Gloess, Miguel-Angel Oros, 1995, JFPLC.

A Hybrid Approach for SAT

Djamal Habet, Chu Min Li, Chu Min Li, 2002, CP.

Equivalency reasoning to solve a class of hard SAT problems

Chu Min Li, 2000, Inf. Process. Lett..

Detecting Disjoint Inconsistent Subformulas for Computing Lower Bounds for Max-SAT

Felip Manyà, Chu Min Li, Jordi Planes, 2006, AAAI.

Within-problem Learning for Efficient Lower Bound Computation in Max-SAT Solving

Kaile Su, Chu Min Li, Han Lin, 2008, AAAI.

An exact algorithm with learning for the graph coloring problem

Chu Min Li, Chong Huang, Chu Min Li, 2014, Comput. Oper. Res..

Exploiting Historical Relationships of Clauses and Variables in Local Search for Satisfiability - (Poster Presentation)

Yu Li, Chu Min Li, Wanxia Wei, 2012, SAT.

Diversification and Determinism in Local Search for Satisfiability

Chu Min Li, Chu Min Li, Wenqi Huang, 2005, SAT.

An Effective Learnt Clause Minimization Approach for CDCL SAT Solvers

Fan Xiao, Zhipeng Lü, Felip Manyà, 2017, IJCAI.

On Boolean Feature Types

Chu Min Li, Paul Y. Gloess, Y.-N. Huang, 1992, WSA.

Towards Solving Many-Valued MaxSAT

Xavier Domingo, Josep Argelich, Felip Manyà, 2006, 36th International Symposium on Multiple-Valued Logic (ISMVL'06).

Look-Ahead Versus Look-Back for Satisfiability Problems

Chu Min Li, Anbulagan, Chu Min Li, 1997, CP.

Satisfying versus Falsifying in Local Search for Satisfiability - (Poster Presentation)

Yu Li, Chu Min Li, 2012, SAT.

Many-Valued MinSAT Solving

Josep Argelich, Zhu Zhu, Felip Manyà, 2014, 2014 IEEE 44th International Symposium on Multiple-Valued Logic.

Clause Branching in MaxSAT and MinSAT

Josep Argelich, Felip Manyà, Chu Min Li, 2018, CCIA.

An Exact Inference Scheme for MinSAT

Felip Manyà, Chu Min Li, Chu Min Li, 2015, IJCAI.

Sum Coloring : New upper bounds for the chromatic strength pdf

Chu Min Li, Corinne Lucet, Clément Lecat, 2016, ArXiv.

Characterizing SAT Problems with the Row Convexity Property

Hachemi Bennaceur, Chu Min Li, 2002, CP.

Analysis and Generation of Pseudo-Industrial MaxSAT Instances

Maria Luisa Bonet, Carlos Ansótegui, Jordi Levy, 2012, CCIA.

A Constraint-Based Approach to Narrow Search Trees for Satisfiability

Chu Min Li, Chu Min Li, 1999, Inf. Process. Lett..

New heuristics for packing unequal circles into a circular container

Yu Li, Chu Min Li, Chu Min Li, 2006, Comput. Oper. Res..

Applying a unified object logic model to implement a strong and dynamic interface between Prolog and an OODBMS

Chu Min Li, Paul Y. Gloess, 1992, BDA.

Exact MinSAT Solving

Zhu Zhu, Felip Manyà, Chu Min Li, 2010, SAT.

Combining Efficient Preprocessing and Incremental MaxSAT Reasoning for MaxClique in Large Graphs

Hua Jiang, Felip Manyà, Chu Min Li, 2016, ECAI.

Exploiting multivalued knowledge in variable selection heuristics for SAT solvers

Carlos Ansótegui, Felip Manyà, Chu Min Li, 2007, Annals of Mathematics and Artificial Intelligence.

Combining MaxSAT Reasoning and Incremental Upper Bound for the Maximum Clique Problem

Hua Jiang, Ke Xu, Chu Min Li, 2013, 2013 IEEE 25th International Conference on Tools with Artificial Intelligence.

Integrating Equivalency Reasoning into Davis-Putnam Procedure

Chu Min Li, Chu Min Li, 2000, AAAI/IAAI.