Recovering and Exploiting Structural Knowledge from CNF Formulas. - Richard Ostrowski; Éric Grégoire; Bertrand Mazure; Lakhdar Sais (CP, 2002)

Eliminating Redundancies in SAT Search Trees. - Richard Ostrowski; Bertrand Mazure; Lakhdar Sais; Éric Grégoire (ICTAI, 2003)

Automatic Extraction of Functional Dependencies. - Éric Grégoire; Richard Ostrowski; Bertrand Mazure; Lakhdar Sais (SAT (Selected Papers, 2004)

Using Boolean Constraint Propagation for Sub-clauses Deduction. - Sylvain Darras; Gilles Dequen; Laure Devendeville; Bertrand Mazure; Richard Ostrowski; Lakhdar Sais (CP, 2005)

Computing Horn Strong Backdoor Sets Thanks to Local Search. - Lionel Paris; Richard Ostrowski; Pierre Siegel; Lakhdar Sais (ICTAI, 2006)

From Horn Strong Backdoor Sets to Ordered Strong Backdoor Sets. - Lionel Paris; Richard Ostrowski; Pierre Siegel; Lakhdar Sais (MICAI, 2007)

From XSAT to SAT by Exhibiting Equivalencies. - Richard Ostrowski; Lionel Paris (ICTAI (1), 2008)

Detecting Boolean Functions for Proving Unsatisfiability. - Richard Ostrowski; Lionel Paris (ICTAI, 2009)

From XSAT to SAT by Exhibiting Boolean Functions. - Richard Ostrowski; Lionel Paris (Int. J. Artif. Intell. Tools, 2009)

Enhancing Clause Learning by Symmetry in SAT Solvers. - Belaid Benhamou; Tarek Nabhani; Richard Ostrowski; Mohamed Réda Saïdi (ICTAI (1), 2010)

Another Way to Browse the Search Space For Some Transformations from CSP to SAT. - Richard Ostrowski; Lionel Paris; Adrien Varet (ISAIM, 2020)