A Boolean Encoding Including SAT and n-ary CSPs. - Lionel Paris; Belaid Benhamou; Pierre Siegel (AIMSA, 2006)

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

Consistent Neighborhood for the Satisfiability Problem. - Djamal Habet; Lionel Paris; Belaid Benhamou (ICTAI (2), 2007)

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)

A Tree Decomposition Based Approach to Solve Structured SAT Instances. - Djamal Habet; Lionel Paris; Cyril Terrioux (ICTAI, 2009)

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

A New Formula Rewriting by Reasoning on a Graphical Representation of SAT Instances. - Philippe Jégou; Lionel Paris (SARA, 2009)

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

Dealing with Satisfiability and n-ary CSPs in a Logical Framework. - Belaid Benhamou; Lionel Paris; Pierre Siegel (J. Autom. Reason., 2012)

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