Lionel Paris

According to our database, Lionel Paris authored at least 11 papers between 2006 and 2020.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2020

Another Way to Browse the Search Space For Some Transformations from CSP to SAT.

Richard Ostrowski, Lionel Paris, Adrien Varet

Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2020

2012

Dealing with Satisfiability and n-ary CSPs in a Logical Framework.

Belaid Benhamou, Lionel Paris, Pierre Siegel

J. Autom. Reason., 2012

2009

From XSAT to SAT by Exhibiting Boolean Functions.

Richard Ostrowski, Lionel Paris

Int. J. Artif. Intell. Tools, 2009

A New Formula Rewriting by Reasoning on a Graphical Representation of SAT Instances.

Philippe Jégou, Lionel Paris

Proceedings of the Eighth Symposium on Abstraction, Reformulation, and Approximation, 2009

Detecting Boolean Functions for Proving Unsatisfiability.

Richard Ostrowski, Lionel Paris

Proceedings of the ICTAI 2009, 2009

A Tree Decomposition Based Approach to Solve Structured SAT Instances.

Djamal Habet, Lionel Paris, Cyril Terrioux

Proceedings of the ICTAI 2009, 2009

2008

From XSAT to SAT by Exhibiting Equivalencies.

Richard Ostrowski, Lionel Paris

Proceedings of the 20th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2008), 2008

2007

From Horn Strong Backdoor Sets to Ordered Strong Backdoor Sets.

Lionel Paris, Richard Ostrowski, Pierre Siegel, Lakhdar Sais

Proceedings of the MICAI 2007: Advances in Artificial Intelligence, 2007

Consistent Neighborhood for the Satisfiability Problem.

Djamal Habet, Lionel Paris, Belaid Benhamou

Proceedings of the 19th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2007), 2007

2006

Computing Horn Strong Backdoor Sets Thanks to Local Search.

Lionel Paris, Richard Ostrowski, Pierre Siegel, Lakhdar Sais

Proceedings of the 18th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2006), 2006

A Boolean Encoding Including SAT and n-ary CSPs.

Lionel Paris, Belaid Benhamou, Pierre Siegel

Proceedings of the Artificial Intelligence: Methodology, 2006