Skip to main content

11 Result(s)

within Chu-Min Li Remove this filter Programming Languages, Compilers, Interpreters Remove this filter

and

  1. No Access

    Chapter and Conference Paper

    MinSAT versus MaxSAT for Optimization Problems

    Despite their similarities, MaxSAT and MinSAT use different encodings and solving techniques to cope with optimization problems. In this paper we describe a new weighted partial MinSAT solver, define original ...

    Josep Argelich, Chu-Min Li, Felip Manyà… in Principles and Practice of Constraint Prog… (2013)

  2. No Access

    Chapter and Conference Paper

    A New Encoding from MinSAT into MaxSAT

    MinSAT is the problem of finding a truth assignment that minimizes the number of satisfied clauses in a CNF formula. When we distinguish between hard and soft clauses, and soft clauses have an associated weigh...

    Zhu Zhu, Chu-Min Li, Felip Manyà… in Principles and Practice of Constraint Prog… (2012)

  3. No Access

    Chapter and Conference Paper

    Transforming Inconsistent Subformulas in MaxSAT Lower Bound Computation

    We define a new heuristic that guides the application of cycle resolution (CR) in MaxSAT, and show that it produces better lower bounds than those obtained by applying CR exhaustively as in Max-DPLL, and by ap...

    Chu Min Li, Felip Manyà… in Principles and Practice of Constraint Prog… (2008)

  4. No Access

    Chapter and Conference Paper

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

    One way to design a local search algorithm that is effective on many types of instances is allowing this algorithm to switch among heuristics. In this paper, we refer to the way in which non-weighting algorithm a...

    Wanxia Wei, Chu Min Li, Harry Zhang in Principles and Practice of Constraint Programming (2008)

  5. No Access

    Chapter and Conference Paper

    On Inconsistent Clause-Subsets for Max-SAT Solving

    Recent research has focused on using the power of look-ahead to speed up the resolution of the Max-SAT problem. Indeed, look-ahead techniques such as Unit Propagation (UP) allow to find conflicts and to quickl...

    Sylvain Darras, Gilles Dequen… in Principles and Practice of Constraint Prog… (2007)

  6. No Access

    Chapter and Conference Paper

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

    One of the main differences between complete SAT solvers and exact Max-SAT solvers is that the former make an intensive use of unit propagation at each node of the proof tree while the latter, in order to ensu...

    Chu Min Li, Felip Manyà, Jordi Planes in Principles and Practice of Constraint Prog… (2005)

  7. No Access

    Chapter and Conference Paper

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

    We propose a two-level search strategy to solve a two dimensional circle packing problem. At the first level, a good enough packing algorithm called A1.0 uses a simple heuristic to select the next circle to be pa...

    Wen Qi Huang, Yu Li, Bernard Jurkowiak… in Principles and Practice of Constraint Prog… (2003)

  8. No Access

    Chapter and Conference Paper

    Characterizing SAT Problems with the Row Convexity Property

    Using the literal encoding of the satisfiability problem (SAT) as a binary constraint satisfaction problem (CSP), we relate the path consistency concept and the row convexity of CSPs with the inference rules i...

    Hachemi Bennaceur… in Principles and Practice of Constraint Programming - CP 2002 (2002)

  9. No Access

    Chapter and Conference Paper

    A Hybrid Approach for SAT

    Exploiting variable dependencies has been shown very useful in local search algorithms for SAT. In this paper, we extend the use of such dependencies by hybridizing a local search algorithm, Walksat, and the D...

    Djamal Habet, Chu Min Li, Laure Devendeville… in Principles and Practice of Constraint Prog… (2002)

  10. No Access

    Chapter and Conference Paper

    Look-ahead versus look-back for satisfiability problems

    CNF propositional satisfiability (SAT) is a special kind of the more general Constraint Satisfaction Problem (CSP). While lookback techniques appear to be of little use to solve hard random SAT problems, it is...

    Chu Min Li, Anbulagan in Principles and Practice of Constraint Programming-CP97 (1997)

  11. 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)