Lionel Paris

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