( en | de | ru )

 

Disambiguation of "Paris, Lionel"

Author of the publication

copydeleteadd this publication to your clipboard
Detecting Boolean Functions for Proving Unsatisfiability.

, and . ICTAI, page 409-416. IEEE Computer Society, (2009)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Andrea Paris

Anja Paris

James Paris

Paris Carbone

Lionel Magloire

 

Other publications of authors with the same name

A Tree Decomposition Based Approach to Solve Structured SAT Instances., , and . ICTAI, page 115-122. IEEE Computer Society, (2009)A Boolean Encoding Including SAT and n-ary CSPs., , and . AIMSA, volume 4183 of Lecture Notes in Computer Science, page 33-44. Springer, (2006)A New Formula Rewriting by Reasoning on a Graphical Representation of SAT Instances., and . SARA, AAAI, (2009)Detecting Boolean Functions for Proving Unsatisfiability., and . ICTAI, page 409-416. IEEE Computer Society, (2009)Computing Horn Strong Backdoor Sets Thanks to Local Search., , , and . ICTAI, page 139-143. IEEE Computer Society, (2006)Another Way to Browse the Search Space For Some Transformations from CSP to SAT., , and . ISAIM, (2020)From XSAT to SAT by Exhibiting Equivalencies., and . ICTAI (1), page 84-91. IEEE Computer Society, (2008)From Horn Strong Backdoor Sets to Ordered Strong Backdoor Sets., , , and . MICAI, volume 4827 of Lecture Notes in Computer Science, page 105-117. Springer, (2007)Consistent Neighborhood for the Satisfiability Problem., , and . ICTAI (2), page 497-501. IEEE Computer Society, (2007)0-7695-3015-X.From XSAT to SAT by Exhibiting Boolean Functions., and . Int. J. Artif. Intell. Tools, 18 (5): 783-799 (2009)