Automatic extraction of functional dependencies

International audienceIn this paper, a new polynomial time technique for extracting functional depedencies in Boolean formulas is proposed. It makes an original use of the well-known Boolean constraint propagation technique (BCP) in a new preprocessing approach that extracts more hidden Boolean functions and dependent variables than previously published approaches on many classes of instances

Light Integration of Path Consistency for Solving CSPs

International audienc

Efficient Symmetry Breaking Predicates for Quantified Boolean Formulae

International audienc

Recording and Minimizing Nogoods from Restarts

International audienc

A New Heuristic-based albeit Complete Method to Extract MUCs from Unsatisfiable CSPs

International audienc

Dépendances Fonctionnelles Booléennes : Détection et Exploitation

12 page

From Horn Strong Backdoor Sets to Ordered Strong Backdoor Sets

International audienc

Reducing hard SAT instances to polynomial ones

International audienc