23 Result(s)

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)

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)

Chapter and Conference Paper

ProQuery: Logical access to an OODB

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