Author of the publication

Exploiting Unit Propagation to Compute Lower Bounds in Branch and Bound Max-SAT Solvers.

, , and . CP, volume 3709 of Lecture Notes in Computer Science, page 403-414. 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.

No persons found for author name Manyà, Felip
add a person with the name Manyà, Felip
 

Other publications of authors with the same name

Efficient Encodings from CSP into SAT, and from MaxCSP into MaxSAT., , , and . Multiple-Valued Logic and Soft Computing, 19 (1-3): 3-23 (2012)Experimenting with the Instances of the MaxSAT Evaluation., , , and . CCIA, volume 232 of Frontiers in Artificial Intelligence and Applications, page 31-40. IOS Press, (2011)Measuring the Hardness of SAT Instances., , , and . AAAI, page 222-228. AAAI Press, (2008)Resolution procedures for multiple-valued optimization., , , and . Inf. Sci., (2013)Clause Vivification by Unit Propagation in CDCL SAT Solvers., , , , , and . CoRR, (2018)Modeling energy consumption in automated vacuum waste collection systems., , , and . Environmental Modelling and Software, (2014)Solving Combinatorial Problems with Regular Local Search Algorithms., and . LPAR, volume 1705 of Lecture Notes in Computer Science, page 33-43. Springer, (1999)Improved Exact Solvers for Weighted Max-SAT., , and . SAT, volume 3569 of Lecture Notes in Computer Science, page 371-377. Springer, (2005)A Preprocessor for Max-SAT Solvers., , and . SAT, volume 4996 of Lecture Notes in Computer Science, page 15-20. Springer, (2008)Clausal Form Transformation in MaxSAT., , and . ISMVL, page 132-137. IEEE, (2019)