Lionel Paris

Publication Activity (10 Years)

Years Active: 2006-2020
Publications (10 Years): 1

Top Topics

Tractable Classes

Logical Framework

Top Venues

J. Autom. Reason.

Publications

Richard Ostrowski, Lionel Paris, Adrien Varet
Another Way to Browse the Search Space For Some Transformations from CSP to SAT. ISAIM (2020)
Belaid Benhamou, Lionel Paris, Pierre Siegel
Dealing with Satisfiability and n-ary CSPs in a Logical Framework. J. Autom. Reason. 48 (3) (2012)
Djamal Habet, Lionel Paris, Cyril Terrioux
A Tree Decomposition Based Approach to Solve Structured SAT Instances. ICTAI (2009)
Richard Ostrowski, Lionel Paris
From XSAT to SAT by Exhibiting Boolean Functions. Int. J. Artif. Intell. Tools 18 (5) (2009)
Philippe Jégou, Lionel Paris
A New Formula Rewriting by Reasoning on a Graphical Representation of SAT Instances. SARA (2009)
Richard Ostrowski, Lionel Paris
Detecting Boolean Functions for Proving Unsatisfiability. ICTAI (2009)
Richard Ostrowski, Lionel Paris
From XSAT to SAT by Exhibiting Equivalencies. ICTAI (1) (2008)
Lionel Paris, Richard Ostrowski, Pierre Siegel, Lakhdar Sais
From Horn Strong Backdoor Sets to Ordered Strong Backdoor Sets. MICAI (2007)
Djamal Habet, Lionel Paris, Belaid Benhamou
Consistent Neighborhood for the Satisfiability Problem. ICTAI (2) (2007)
Lionel Paris, Belaid Benhamou, Pierre Siegel
A Boolean Encoding Including SAT and n-ary CSPs. AIMSA (2006)
Lionel Paris, Richard Ostrowski, Pierre Siegel, Lakhdar Sais
Computing Horn Strong Backdoor Sets Thanks to Local Search. ICTAI (2006)