( en | de | ru )

 

Disambiguation of "Rodríguez-Carbonell, Enric"

Author of the publication

copydeleteadd this publication to your clipboard
To Encode or to Propagate? The Best Choice for Each Constraint in SAT.

, , , , and . CP, volume 8124 of Lecture Notes in Computer Science, page 97-106. Springer, (2013)

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.

Pere Carbonell

Daniel Rodríguez

Agustín Rodríguez

Carlos Rodríguez

Jerónimo Rodríguez

 

Other publications of authors with the same name

Employee Scheduling With SAT-Based Pseudo-Boolean Constraint Solving., , , and . IEEE Access, (2021)Cardinality Networks: a theoretical and empirical study., , , and . Constraints An Int. J., 16 (2): 195-221 (2011)Automatic generation of polynomial invariants of bounded degree using abstract interpretation., and . Sci. Comput. Program., 64 (1): 54-75 (2007)Analyzing Multiple Conflicts in SAT: An Experimental Evaluation., , and . LPAR, volume 94 of EPiC Series in Computing, page 306-316. EasyChair, (2023)A Parametric Approach for Smaller and Better Encodings of Cardinality Constraints., , , and . CP, volume 8124 of Lecture Notes in Computer Science, page 80-96. Springer, (2013)A New Look at BDDs for Pseudo-Boolean Constraints., , , , and . CoRR, (2014)The Barcelogic SMT Solver., , , , and . CAV, volume 5123 of Lecture Notes in Computer Science, page 294-298. Springer, (2008)SAT Modulo Linear Arithmetic for Solving Polynomial Constraints., , , , and . J. Autom. Reason., 48 (1): 107-131 (2012)A Framework for Certified Boolean Branch-and-Bound Optimization., , , and . J. Autom. Reason., 46 (1): 81-102 (2011)The recursive path and polynomial ordering for first-order and higher-order terms., , , and . J. Log. Comput., 23 (1): 263-305 (2013)