Author of the publication

Sequential Encodings from Max-CSP into Partial Max-SAT.

, , , and . SAT, volume 5584 of Lecture Notes in Computer Science, page 161-166. Springer, (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.

 

Other publications of authors with the same name

A branch and bound algorithm for extracting smallest minimal unsatisfiable subformulas., , , , , and . Constraints An Int. J., 14 (4): 415-442 (2009)Haplotype Inference by Pure Parsimony: A Survey., , , and . J. Comput. Biol., 17 (8): 969-992 (2010)Random backtracking in backtrack search algorithms for satisfiability., and . Discret. Appl. Math., 155 (12): 1604-1612 (2007)Computing the Summed Adjacency Disruption Number between Two Genomes with Duplicate Genes Using Pseudo-Boolean Optimization., , and . RECOMB-CG, volume 5817 of Lecture Notes in Computer Science, page 138-149. Springer, (2009)Concurrency Debugging with MaxSMT., , , and . AAAI, page 1608-1616. AAAI Press, (2019)Improving Search Space Splitting for Parallel SAT Solving., , and . ICTAI (1), page 336-343. IEEE Computer Society, (2010)On Improving MUS Extraction Algorithms., and . SAT, volume 6695 of Lecture Notes in Computer Science, page 159-173. Springer, (2011)Towards Provably Complete Stochastic Search Algorithms for Satisfiability., , and . EPIA, volume 2258 of Lecture Notes in Computer Science, page 363-370. Springer, (2001)Improving SAT Algorithms by Using Search Pruning Techniques., and . CP, volume 2239 of Lecture Notes in Computer Science, page 770. Springer, (2001)Efficient Haplotype Inference with Pseudo-boolean Optimization., , , and . AB, volume 4545 of Lecture Notes in Computer Science, page 125-139. Springer, (2007)