PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Audemard, Gilles"

Author of the publication

copydeleteadd this publication to your clipboard
Impact of Community Structure on SAT Solver Performance.

, , , , and . SAT, volume 8561 of Lecture Notes in Computer Science, page 252-268. Springer, (2014)

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.

No persons found for author name Audemard, Gilles
add a person with the name Audemard, Gilles
 

Other publications of authors with the same name

SAT graph-based representation: A new perspective., , and . J. Algorithms, 63 (1-3): 17-33 (2008)Predicting and Detecting Symmetries in FOL Finite Model Search., , and . J. Autom. Reasoning, 36 (3): 177-212 (2006)Improving Glucose for Incremental SAT Solving with Assumptions: Application to MUS Extraction., , and . SAT, volume 7962 of Lecture Notes in Computer Science, page 309-317. Springer, (2013)A Distributed Version of Syrup., , , and . SAT, volume 10491 of Lecture Notes in Computer Science, page 215-232. Springer, (2017)Etude des symétries dans les modèles finis., and . JFPLC, page 109-122. Hermes, (2001)Impact of Community Structure on SAT Solver Performance., , , , and . SAT, volume 8561 of Lecture Notes in Computer Science, page 252-268. Springer, (2014)Lazy Clause Exchange Policy for Parallel SAT Solvers., and . SAT, volume 8561 of Lecture Notes in Computer Science, page 197-205. Springer, (2014)Circuit Based Encoding of CNF Formula., and . SAT, volume 4501 of Lecture Notes in Computer Science, page 16-21. Springer, (2007)Bounded Model Checking for Timed Systems., , , and . FORTE, volume 2529 of Lecture Notes in Computer Science, page 243-259. Springer, (2002)Améliorer SAT dans le cadre incrémental., , , and . Rev. d'Intelligence Artif., 28 (5): 593-614 (2014)