I have broad interest in artificial intelligence and its applications. My research is concerned with the practical resolution of NP-hard problems, including Boolean Satisfiability Problem(SAT), Maximum Satisfiability Problem (MaxSAT), Minimum Vertex Cover Problem (MVC), Maximum Clique Problem (MC) and Graph Coloring Problem (GC). I am particularly interested in the combinatorial problem with the heuristic algorithm and exact algorithm.