Skip to main content

4 Result(s)

within Chu-Min Li Remove this filter Theory of Computation Remove this filter

and

  1. No Access

    Article

    Parallel Bounded Search for the Maximum Clique Problem

    Given an undirected graph, the Maximum Clique Problem (MCP) is to find a largest complete subgraph of the graph. MCP is NP-hard and has found many practical applications. In this paper, we propose a parallel B...

    Hua Jiang, Ke Bai, Hai-Jiao Liu, Chu-Min Li… in Journal of Computer Science and Technology (2023)

  2. No Access

    Chapter

    Inference in MaxSAT and MinSAT

    Logical calculi applied to solve SAT are unsound for MaxSAT and MinSAT because they preserve satisfiability but not the minimum and the maximum number of unsatisfied clauses, respectively. This paper overviews...

    Chu Min Li, Felip Manyà in The Logic of Software. A Tasting Menu of Formal Methods (2022)

  3. No Access

    Book and Conference Proceedings

    Theory and Applications of Satisfiability Testing – SAT 2021

    24th International Conference, Barcelona, Spain, July 5-9, 2021, Proceedings

    Chu-Min Li, Felip Manyà in Lecture Notes in Computer Science (2021)

  4. No Access

    Chapter and Conference Paper

    ProQuery: Logical access to an OODB

    Chu Min Li, Paul Y. Gloess in Programming Language Implementation and Logic Programming (1992)