Author of the publication

Using Boolean Constraint Propagation for Sub-clauses Deduction.

, , , , , and . CP, volume 3709 of Lecture Notes in Computer Science, page 757-761. Springer, (2005)

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.

 

Other publications of authors with the same name

Recovering and Exploiting Structural Knowledge from CNF Formulas., , , and . CP, volume 2470 of Lecture Notes in Computer Science, page 185-199. Springer, (2002)Automatic Extraction of Functional Dependencies., , , and . SAT, (2004)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)From XSAT to SAT by Exhibiting Equivalencies., and . ICTAI (1), page 84-91. IEEE Computer Society, (2008)From XSAT to SAT by Exhibiting Boolean Functions., and . Int. J. Artif. Intell. Tools, 18 (5): 783-799 (2009)Eliminating Redundancies in SAT Search Trees., , , and . ICTAI, page 100-104. IEEE Computer Society, (2003)Using Boolean Constraint Propagation for Sub-clauses Deduction., , , , , and . CP, volume 3709 of Lecture Notes in Computer Science, page 757-761. Springer, (2005)Enhancing Clause Learning by Symmetry in SAT Solvers., , , and . ICTAI (1), page 329-335. IEEE Computer Society, (2010)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)