A gender-based genetic algorithm for the automatic configuration of algorithms C Ansótegui, M Sellmann, K Tierney International Conference on Principles and Practice of Constraint …, 2009 | 435 | 2009 |
SAT-based MaxSAT algorithms C Ansótegui, ML Bonet, J Levy Artificial Intelligence 196, 77-105, 2013 | 196 | 2013 |
Solving (weighted) partial MaxSAT through satisfiability testing C Ansótegui, ML Bonet, J Levy International conference on theory and applications of satisfiability …, 2009 | 194 | 2009 |
Model-Based Genetic Algorithms for Algorithm Configuration. C Ansótegui, Y Malitsky, H Samulowitz, M Sellmann, K Tierney IJCAI, 733-739, 2015 | 145 | 2015 |
Mapping problems with finite-domain variables to problems with boolean variables C Ansótegui, F Manya International conference on theory and applications of satisfiability …, 2004 | 143 | 2004 |
The community structure of SAT formulas C Ansótegui, J Giráldez-Cru, J Levy International Conference on Theory and Applications of Satisfiability …, 2012 | 130 | 2012 |
The Achilles' heel of QBF C Ansótegui, CP Gomes, B Selman AAAI 2, 2.1, 2005 | 105 | 2005 |
MaxSAT by improved instance-specific algorithm configuration C Ansótegui, J Gabas, Y Malitsky, M Sellmann Artificial Intelligence 235, 26-39, 2016 | 91 | 2016 |
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 | 87 | 2010 |
Random SAT instances à la carte C Ansótegui, ML Bonet, J Levy Artificial Intelligence Research and Development, 109-117, 2008 | 78 | 2008 |
On the structure of industrial SAT instances C Ansótegui, ML Bonet, J Levy International Conference on Principles and Practice of Constraint …, 2009 | 77 | 2009 |
Measuring the Hardness of SAT Instances. C Ansótegui, ML Bonet, J Levy, F Manya AAAI 8, 222-228, 2008 | 73 | 2008 |
Improving SAT-based weighted MaxSAT solvers C Ansótegui, ML Bonet, J Gabas, J Levy International conference on principles and practice of constraint …, 2012 | 69 | 2012 |
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 |
Moral values in norm decision making M Serramia, M Lopez-Sanchez, JA Rodriguez-Aguilar, M Rodriguez, ... International Foundation for AutonomousAgents and Multiagent Systems, 2018 | 59 | 2018 |
WPM3: an (in) complete algorithm for weighted partial MaxSAT C Ansótegui, J Gabàs Artificial Intelligence 250, 37-57, 2017 | 57 | 2017 |
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 | 50 | 2015 |
Community structure in industrial SAT instances C Ansótegui, ML Bonet, J Giráldez-Cru, J Levy, L Simon Journal of Artificial Intelligence Research 66, 443-472, 2019 | 47 | 2019 |
Solving (Weighted) Partial MaxSAT with ILP. C Ansótegui, J Gabas CPAIOR 13, 403-409, 2013 | 47 | 2013 |
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 | 45 | 2011 |