( en | de | ru )

 

Disambiguation of "Larrosa, Javier"

Author of the publication

copydeleteadd this publication to your clipboard
New Inference Rules for Efficient Max-SAT Solving.

, and . AAAI, page 68-73. AAAI Press, (2006)

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.

Javier Manero

Javier Jáurequi

Javier Dreyer

Javier Papa

Javier Arpón

 

Other publications of authors with the same name

Using Constraints with Memory to Implement Variable Elimination., , and . ECAI, page 216-220. IOS Press, (2004)Towards a Better Understanding of (Partial Weighted) MaxSAT Proof Systems., and . SAT, volume 12178 of Lecture Notes in Computer Science, page 218-232. Springer, (2020)New Inference Rules for Efficient Max-SAT Solving., and . AAAI, page 68-73. AAAI Press, (2006)Solving Max-SAT as Weighted CSP., , , and . CP, volume 2833 of Lecture Notes in Computer Science, page 363-376. Springer, (2003)Solving 'Still Life' with Soft Constraints and Bucket Elimination., and . CP, volume 2833 of Lecture Notes in Computer Science, page 466-479. Springer, (2003)Choosing the Root of the Tree Decomposition When Solving WCSPs: Preliminary Results., , and . CCIA, volume 339 of Frontiers in Artificial Intelligence and Applications, page 56-65. IOS Press, (2021)Semiring-Based Mini-Bucket Partitioning Schemes., , and . IJCAI, page 644-650. IJCAI/AAAI, (2013)Constraint Satisfaction as Global Optimization., and . IJCAI (1), page 579-585. Morgan Kaufmann, (1995)MiniMaxSat: A New Weighted Max-SAT Solver., , and . SAT, volume 4501 of Lecture Notes in Computer Science, page 41-55. Springer, (2007)Lower Bounds for Non-binary Constraint Optimization Problems., , and . CP, volume 2239 of Lecture Notes in Computer Science, page 317-331. Springer, (2001)