| A gender-based genetic algorithm for the automatic configuration of algorithms C Ansótegui, M Sellmann, K Tierney Principles and Practice of Constraint Programming-CP 2009: 15th …, 2009 | 383 | 2009 |
| Solving (weighted) partial MaxSAT through satisfiability testing C Ansótegui, ML Bonet, J Levy Theory and Applications of Satisfiability Testing-SAT 2009: 12th …, 2009 | 186 | 2009 |
| SAT-based MaxSAT algorithms C Ansótegui, ML Bonet, J Levy Artificial Intelligence 196, 77-105, 2013 | 172 | 2013 |
| Mapping problems with finite-domain variables to problems with boolean variables C Ansótegui, F Manya Theory and Applications of Satisfiability Testing: 7th International …, 2005 | 130 | 2005 |
| Model-based genetic algorithms for algorithm configuration C Ansótegui, Y Malitsky, H Samulowitz, M Sellmann, K Tierney Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015 | 120 | 2015 |
| The community structure of SAT formulas C Ansótegui, J Giráldez-Cru, J Levy Theory and Applications of Satisfiability Testing–SAT 2012: 15th …, 2012 | 120 | 2012 |
| The Achilles' heel of QBF C Ansótegui, CP Gomes, B Selman AAAI 2, 2.1, 2005 | 95 | 2005 |
| A new algorithm for weighted partial MaxSAT C Ansótegui, ML Bonet, J Levy Proceedings of the AAAI Conference on Artificial Intelligence 24 (1), 3-8, 2010 | 78 | 2010 |
| MaxSAT by improved instance-specific algorithm configuration C Ansótegui, J Gabas, Y Malitsky, M Sellmann Artificial Intelligence 235, 26-39, 2016 | 77 | 2016 |
| Measuring the Hardness of SAT Instances. C Ansótegui, ML Bonet, J Levy, F Manya AAAI 8, 222-228, 2008 | 65 | 2008 |
| On the structure of industrial SAT instances C Ansótegui, ML Bonet, J Levy Principles and Practice of Constraint Programming-CP 2009: 15th …, 2009 | 63 | 2009 |
| Random SAT instances à la carte C Ansótegui, ML Bonet, J Levy Artificial Intelligence Research and Development, 109-117, 2008 | 63 | 2008 |
| QBF modeling: Exploiting player symmetry for simplicity and efficiency A Sabharwal, C Ansotegui, CP Gomes, JW Hart, B Selman Theory and Applications of Satisfiability Testing-SAT 2006: 9th …, 2006 | 62 | 2006 |
| Improving SAT-based weighted MaxSAT solvers C Ansótegui, ML Bonet, J Gabas, J Levy Principles and Practice of Constraint Programming: 18th International …, 2012 | 61 | 2012 |
| Solving (Weighted) Partial MaxSAT with ILP. C Ansótegui, J Gabas CPAIOR 13, 403-409, 2013 | 45 | 2013 |
| Exploiting the structure of unsatisfiable cores in MaxSAT C Ansótegui, F Didier, J Gabàs Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015 | 44 | 2015 |
| Satisfiability modulo theories: An efficient approach for the resource-constrained project scheduling problem C Ansótegui, M Bofill, M Palahı, J Suy, M Villaret Proceedings of the 9th Symposium on Abstraction, Reformulation and …, 2011 | 43 | 2011 |
| WPM3: an (in) complete algorithm for weighted partial MaxSAT C Ansótegui, J Gabàs Artificial Intelligence 250, 37-57, 2017 | 41 | 2017 |
| Using community structure to detect relevant learnt clauses C Ansótegui, J Giráldez-Cru, J Levy, L Simon Theory and Applications of Satisfiability Testing--SAT 2015: 18th …, 2015 | 41 | 2015 |
| Modeling choices in quasigroup completion: SAT vs. CSP C Ansótegui, A del Val, I Dotú, C Fernández, F Manya AAAI, 137-142, 2004 | 41 | 2004 |
Jordi LevyResearch Scientist, IIIA-CSICVerified email at iiia.csic.es
