Chu Min Li

Orcid: 0000-0002-6886-8434

According to our database1, Chu Min Li authored at least 129 papers between 1992 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Rethinking the Soft Conflict Pseudo Boolean Constraint on MaxSAT Local Search Solvers.
CoRR, 2024

Threshold-Based Responsive Simulated Annealing for Directed Feedback Vertex Set Problem.
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023
A vertex weighting-based double-tabu search algorithm for the classical p-center problem.
Comput. Oper. Res., December, 2023

MaxSAT resolution for regular propositional logic.
Int. J. Approx. Reason., November, 2023

Parallel Bounded Search for the Maximum Clique Problem.
J. Comput. Sci. Technol., September, 2023

On solving simplified diversified top-k s-plex problem.
Comput. Oper. Res., May, 2023

Reinforced Lin-Kernighan-Helsgaun algorithms for the traveling salesman problems.
Knowl. Based Syst., 2023

An Efficient Solution Space Exploring and Descent Method for Packing Equal Spheres in a Sphere.
CoRR, 2023

Geometric Batch Optimization for the Packing Equal Circles in a Circle Problem on Large Scale.
CoRR, 2023

A Tableau Calculus for Signed Maximum Satisfiability.
Proceedings of the 53rd IEEE International Symposium on Multiple-Valued Logic, 2023

A New Variable Ordering for In-processing Bounded Variable Elimination in SAT Solvers.
Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

A Complete Tableau Calculus for the Regular MaxSAT Problem.
Proceedings of the Artificial Intelligence Research and Development, 2023

Hybrid Learning with New Value Function for the Maximum Common Induced Subgraph Problem.
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022
Clustering Driven Iterated Hybrid Search for Vertex Bisection Minimization.
IEEE Trans. Computers, 2022

Branching Strategy Selection Approach Based on Vivification Ratio.
Int. J. Softw. Informatics, 2022

Clausal Forms in MaxSAT and MinSAT.
Int. J. Comput. Intell. Syst., 2022

Incorporating Multi-armed Bandit with Local Search for MaxSAT.
CoRR, 2022

Hybrid Learning with New Value Function for the Maximum Common Subgraph Problem.
CoRR, 2022

Boosting branch-and-bound MaxSAT solvers with clause learning.
AI Commun., 2022

A Strengthened Branch and Bound Algorithm for the Maximum Common (Connected) Subgraph Problem.
Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

BandMaxSAT: A Local Search MaxSAT Solver with Multi-armed Bandit.
Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

Combining Clause Learning and Branch and Bound for MaxSAT (Extended Abstract).
Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

HEA-D: A Hybrid Evolutionary Algorithm for Diversified Top-k Weight Clique Search Problem.
Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

A Tableau Calculus for MaxSAT Based on Resolution.
Proceedings of the Artificial Intelligence Research and Development, 2022

Inference in MaxSAT and MinSAT.
Proceedings of the Logic of Software. A Tasting Menu of Formal Methods, 2022

2021
MaxSAT, Hard and Soft Constraints.
Proceedings of the Handbook of Satisfiability - Second Edition, 2021

A resolution calculus for MinSAT.
Log. J. IGPL, 2021

Clause tableaux for maximum and minimum satisfiability.
Log. J. IGPL, 2021

Branching Strategy Selection Approach Based on Vivification Ratio.
CoRR, 2021

Solving longest common subsequence problems via a transformation to the maximum clique problem.
Comput. Oper. Res., 2021

Solving diversified top-k weight clique search problem.
Sci. China Inf. Sci., 2021

Combining Clause Learning and Branch and Bound for MaxSAT.
Proceedings of the 27th International Conference on Principles and Practice of Constraint Programming, 2021

From Non-Clausal to Clausal MinSAT.
Proceedings of the Artificial Intelligence Research and Development, 2021

Combining Reinforcement Learning with Lin-Kernighan-Helsgaun Algorithm for the Traveling Salesman Problem.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

Weighting-based Variable Neighborhood Search for Optimal Camera Placement.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020
Stochastic Item Descent Method for Large Scale Equal Circle Packing Problem.
CoRR, 2020

Local search for diversified Top-<i>k</i> clique search problem.
Comput. Oper. Res., 2020

Clause vivification by unit propagation in CDCL SAT solvers.
Artif. Intell., 2020

Effective Approaches to Solve P-Center Problem via Set Covering and SAT.
IEEE Access, 2020

Tableaux for Maximum Satisfiability in Łukasiewicz Logic.
Proceedings of the 50th IEEE International Symposium on Multiple-Valued Logic, 2020

Vertex Weighting-Based Tabu Search for p-Center Problem.
Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

Weighting-based parallel local search for optimal camera placement and unicost set covering.
Proceedings of the GECCO '20: Genetic and Evolutionary Computation Conference, 2020

A Learning Based Branch and Bound for Maximum Common Subgraph Related Problems.
Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019
An Effective Variable Neighborhood Search with Perturbation for Location-Routing Problem.
Int. J. Artif. Intell. Tools, 2019

A Learning based Branch and Bound for Maximum Common Subgraph Problems.
CoRR, 2019

An Exact Algorithm for Minimum Weight Vertex Cover Problem in Large Graphs.
CoRR, 2019

An iterative Path-Breaking approach with mutation and restart strategies for the MAX-SAT problem.
Comput. Oper. Res., 2019

A branching heuristic for SAT solvers based on complete implication graphs.
Sci. China Inf. Sci., 2019

A Tableau Calculus for Non-clausal Maximum Satisfiability.
Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 2019

Clausal Form Transformation in MaxSAT.
Proceedings of the 2019 IEEE 49th International Symposium on Multiple-Valued Logic (ISMVL), 2019

A Two-Individual Based Evolutionary Algorithm for the Flexible Job Shop Scheduling Problem.
Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018
Incremental Upper Bound for the Maximum Clique Problem.
INFORMS J. Comput., 2018

A new upper bound for the maximum weight clique problem.
Eur. J. Oper. Res., 2018

GMDS-ZNN Variants Having Errors Proportional to Sampling Gap as Compared with Models 1 and 2 Having Higher Precision.
Proceedings of the 5th International Conference on Systems and Informatics, 2018

Clause Branching in MaxSAT and MinSAT.
Proceedings of the Artificial Intelligence Research and Development, 2018

A Two-Stage MaxSAT Reasoning Approach for the Maximum Weight Clique Problem.
Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

2017
Minimum sum coloring problem: Upper bounds for the chromatic strength.
Discret. Appl. Math., 2017

On minimization of the number of branches in branch-and-bound algorithms for the maximum clique problem.
Comput. Oper. Res., 2017

An iterative merging algorithm for soft rectangle packing and its extension for application of fixed-outline floorplanning of soft modules.
Comput. Oper. Res., 2017

Exploiting Many-Valued Variables in MaxSAT.
Proceedings of the 47th IEEE International Symposium on Multiple-Valued Logic, 2017

An Effective Learnt Clause Minimization Approach for CDCL SAT Solvers.
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

New Lower Bound for the Minimum Sum Coloring Problem.
Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

An Exact Algorithm for the Maximum Weight Clique Problem in Large Graphs.
Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016
An Exact Algorithm Based on MaxSAT Reasoning for the Maximum Weight Clique Problem.
J. Artif. Intell. Res., 2016

Sum Coloring : New upper bounds for the chromatic strength.
CoRR, 2016

A Clause Tableau Calculus for MaxSAT.
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

Breaking Cycle Structure to Improve Lower Bound for Max-SAT.
Proceedings of the Frontiers in Algorithmics, 10th International Workshop, 2016

Combining Efficient Preprocessing and Incremental MaxSAT Reasoning for MaxClique in Large Graphs.
Proceedings of the ECAI 2016 - 22nd European Conference on Artificial Intelligence, 29 August-2 September 2016, The Hague, The Netherlands, 2016

A Clause Tableau Calculus for MinSAT.
Proceedings of the Artificial Intelligence Research and Development, 2016

2015
Dynamic reduction heuristics for the rectangle packing area minimization problem.
Eur. J. Oper. Res., 2015

On Reducing Clause DataBase in Glucose.
Proceedings of the IWIL@LPAR 2015, 2015

Incremental MaxSAT Reasoning to Reduce Branches in a Branch-and-Bound Algorithm for MaxClique.
Proceedings of the Learning and Intelligent Optimization - 9th International Conference, 2015

An Exact Inference Scheme for MinSAT.
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

2014
An iterative merging placement algorithm for the fixed-outline floorplanning.
CoRR, 2014

An exact algorithm with learning for the graph coloring problem.
Comput. Oper. Res., 2014

Many-Valued MinSAT Solving.
Proceedings of the IEEE 44th International Symposium on Multiple-Valued Logic, 2014

Solving Maximum Weight Clique Using Maximum Satisfiability Reasoning.
Proceedings of the ECAI 2014 - 21st European Conference on Artificial Intelligence, 18-22 August 2014, Prague, Czech Republic, 2014

2013
Combining MaxSAT Reasoning and Incremental Upper Bound for the Maximum Clique Problem.
Proceedings of the 25th IEEE International Conference on Tools with Artificial Intelligence, 2013

MinSAT versus MaxSAT for Optimization Problems.
Proceedings of the Principles and Practice of Constraint Programming, 2013

2012
Optimizing with minimum satisfiability.
Artif. Intell., 2012

Exploiting Historical Relationships of Clauses and Variables in Local Search for Satisfiability - (Poster Presentation).
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2012, 2012

Satisfying versus Falsifying in Local Search for Satisfiability - (Poster Presentation).
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2012, 2012

A New Encoding from MinSAT into MaxSAT.
Proceedings of the Principles and Practice of Constraint Programming, 2012

A SAT-Based Approach to MinSAT.
Proceedings of the Artificial Intelligence Research and Development, 2012

Analysis and Generation of Pseudo-Industrial MaxSAT Instances.
Proceedings of the Artificial Intelligence Research and Development, 2012

2011
Analyzing the Instances of the MaxSAT Evaluation.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2011, 2011

Minimum Satisfiability and Its Applications.
Proceedings of the IJCAI 2011, 2011

Experimenting with the Instances of the MaxSAT Evaluation.
Proceedings of the Artificial Intelligence Research and Development, 2011

2010
Resolution-based lower bounds in MaxSAT.
Constraints An Int. J., 2010

Exact MinSAT Solving.
Proceedings of the Theory and Applications of Satisfiability Testing, 2010

Combining Graph Structure Exploitation and Propositional Reasoning for the Maximum Clique Problem.
Proceedings of the 22nd IEEE International Conference on Tools with Artificial Intelligence, 2010

An Efficient Branch-and-Bound Algorithm Based on MaxSAT for the Maximum Clique Problem.
Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, 2010

2009
MaxSAT, Hard and Soft Constraints.
Proceedings of the Handbook of Satisfiability, 2009

Exploiting Cycle Structures in Max-SAT.
Proceedings of the Theory and Applications of Satisfiability Testing, 2009

2008
A Switching Criterion for Intensification and Diversification in Local Search for SAT.
J. Satisf. Boolean Model. Comput., 2008

Guest Editors Conclusion.
J. Satisf. Boolean Model. Comput., 2008

The First and Second Max-SAT Evaluations.
J. Satisf. Boolean Model. Comput., 2008

A Preprocessor for Max-SAT Solvers.
Proceedings of the Theory and Applications of Satisfiability Testing, 2008

Switching among Non-Weighting, Clause Weighting, and Variable Weighting in Local Search for SAT.
Proceedings of the Principles and Practice of Constraint Programming, 2008

Transforming Inconsistent Subformulas in MaxSAT Lower Bound Computation.
Proceedings of the Principles and Practice of Constraint Programming, 2008

Within-problem Learning for Efficient Lower Bound Computation in Max-SAT Solving.
Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence, 2008

2007
New Inference Rules for Max-SAT.
J. Artif. Intell. Res., 2007

Exploiting multivalued knowledge in variable selection heuristics for SAT solvers.
Ann. Math. Artif. Intell., 2007

Combining Adaptive Noise and Look-Ahead in Local Search for SAT.
Proceedings of the Theory and Applications of Satisfiability Testing, 2007

On Inconsistent Clause-Subsets for Max-SAT Solving.
Proceedings of the Principles and Practice of Constraint Programming, 2007

2006
New heuristics for packing unequal circles into a circular container.
Comput. Oper. Res., 2006

Modeling and optimization of the capacity allocation problem with constraints.
Proceedings of the 4th International Confernce on Computer Sciences: Research, 2006

Towards Solving Many-Valued MaxSAT.
Proceedings of the 36th IEEE International Symposium on Multiple-Valued Logic (ISMVL 2006), 2006

An Algorithm for a Constraint Optimization Problem in Mobile Ad-hoc Networks.
Proceedings of the 18th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2006), 2006

Detecting Disjoint Inconsistent Subformulas for Computing Lower Bounds for Max-SAT.
Proceedings of the Proceedings, 2006

2005
A Parallelization Scheme Based on Work Stealing for a Class of SAT Solvers.
J. Autom. Reason., 2005

Diversification and Determinism in Local Search for Satisfiability.
Proceedings of the Theory and Applications of Satisfiability Testing, 2005

Exploiting Unit Propagation to Compute Lower Bounds in Branch and Bound Max-SAT Solvers.
Proceedings of the Principles and Practice of Constraint Programming, 2005

2003
On the limit of branching rules for hard random unsatisfiable 3-SAT.
Discret. Appl. Math., 2003

Equivalent literal propagation in the DLL procedure.
Discret. Appl. Math., 2003

A Two-Level Search Strategy for Packing Unequal Circles into a Circle Container.
Proceedings of the Principles and Practice of Constraint Programming, 2003

2002
A Hybrid Approach for SAT.
Proceedings of the Principles and Practice of Constraint Programming, 2002

Characterizing SAT Problems with the Row Convexity Property.
Proceedings of the Principles and Practice of Constraint Programming, 2002

2001
Parallelizing Satz Using Dynamic Workload Balancing.
Electron. Notes Discret. Math., 2001

2000
Equivalency reasoning to solve a class of hard SAT problems.
Inf. Process. Lett., 2000

Integrating Equivalency Reasoning into Davis-Putnam Procedure.
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on on Innovative Applications of Artificial Intelligence, July 30, 2000

1999
A Constraint-Based Approach to Narrow Search Trees for Satisfiability.
Inf. Process. Lett., 1999

1997
Heuristics Based on Unit Propagation for Satisfiability Problems.
Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence, 1997

Look-Ahead Versus Look-Back for Satisfiability Problems.
Proceedings of the Principles and Practice of Constraint Programming - CP97, Third International Conference, Linz, Austria, October 29, 1997

1995
U-Log = datalog + constraints.
Proceedings of the JFPLC'95, 1995

1992
On Boolean Feature Types.
Proceedings of the Actes WSA'92 Workshop on Static Analysis (Bordeaux, 1992

ProQuery: Logical Access to an OODB.
Proceedings of the Programming Language Implementation and Logic Programming, 1992

Realizing an efficient and incremental access to an object oriented database with Prolog.
Proceedings of the JFPL'92, 1992

Applying a unified object logic model to implement a strong and dynamic interface between Prolog and an OODBMS.
Proceedings of the VIIIèmes Journées Bases de Données Avancées, 1992


  Loading...