| Conflict-driven clause learning SAT solvers J Marques-Silva, I Lynce, S Malik Handbook of satisfiability, 131-153, 2009 | 789 | 2009 |
| Open-WBO: A Modular MaxSAT Solver, R Martins, V Manquinho, I Lynce International Conference on Theory and Applications of Satisfiability …, 2014 | 306 | 2014 |
| Sudoku as a SAT Problem. I Lynce, J Ouaknine AI&M, 2006 | 249 | 2006 |
| On computing minimum unsatisfiable cores I Lynce, JP Marques-Silva | 200 | 2004 |
| Towards robust CNF encodings of cardinality constraints J Marques-Silva, I Lynce International Conference on Principles and Practice of Constraint …, 2007 | 161 | 2007 |
| Incremental cardinality constraints for MaxSAT R Martins, S Joshi, V Manquinho, I Lynce International Conference on Principles and Practice of Constraint …, 2014 | 137 | 2014 |
| Efficient haplotype inference with Boolean satisfiability I Lynce, J Marques-Silva National conference on artificial intelligence (AAAI), 2006 | 134 | 2006 |
| Boolean lexicographic optimization: algorithms & applications J Marques-Silva, J Argelich, A Graça, I Lynce Annals of Mathematics and Artificial Intelligence 62 (3), 317-343, 2011 | 130 | 2011 |
| Towards efficient MUS extraction A Belov, I Lynce, J Marques-Silva AI Communications 25 (2), 97-116, 2012 | 121 | 2012 |
| Probing-based preprocessing techniques for propositional satisfiability I Lynce, J Marques-Silva Proceedings. 15th IEEE International Conference on Tools with Artificial …, 2003 | 111 | 2003 |
| An overview of parallel SAT solving R Martins, V Manquinho, I Lynce Constraints 17 (3), 304-347, 2012 | 98 | 2012 |
| SAT in bioinformatics: Making the case with haplotype inference I Lynce, J Marques-Silva International Conference on Theory and Applications of Satisfiability …, 2006 | 98 | 2006 |
| On improving MUS extraction algorithms J Marques-Silva, I Lynce International Conference on Theory and Applications of Satisfiability …, 2011 | 95 | 2011 |
| Algorithms for computing backbones of propositional formulae M Janota, I Lynce, J Marques-Silva Ai Communications 28 (2), 161-177, 2015 | 86 | 2015 |
| Solving linux upgradeability problems using boolean optimization J Argelich, DL Berre, I Lynce, J Marques-Silva, P Rapicault arXiv preprint arXiv:1007.1021, 2010 | 78 | 2010 |
| Efficient data structures for backtrack search SAT solvers I Lynce, J Marques-Silva Annals of Mathematics and Artificial Intelligence 43 (1), 137-152, 2005 | 72 | 2005 |
| A branch-and-bound algorithm for extracting smallest minimal unsatisfiable formulas M Mneimneh, I Lynce, Z Andraus, J Marques-Silva, K Sakallah International Conference on Theory and Applications of Satisfiability …, 2005 | 71 | 2005 |
| On computing backbones of propositional theories J Marques-Silva, M Janota, I Lynce ECAI 2010, 15-20, 2010 | 65 | 2010 |
| Reasoning over biological networks using maximum satisfiability J Guerra, I Lynce International conference on principles and practice of constraint …, 2012 | 57 | 2012 |
| Categorisation of clauses in conjunctive normal forms: Minimally unsatisfiable sub-clause-sets and the lean kernel O Kullmann, I Lynce, J Marques-Silva International Conference on Theory and Applications of Satisfiability …, 2006 | 56 | 2006 |
Joao Marques-SilvaResearch Professor, ICREA, University of LleidaVerified email at icrea.cat
