Conflict-driven clause learning SAT solvers J Marques-Silva, I Lynce, S Malik Handbook of satisfiability, 133-182, 2021 | 656 | 2021 |
Open-WBO: A Modular MaxSAT Solver, R Martins, V Manquinho, I Lynce Theory and Applications of Satisfiability Testing–SAT 2014: 17th …, 2014 | 259 | 2014 |
Sudoku as a SAT Problem. I Lynce, J Ouaknine AI&M, 2006 | 238 | 2006 |
On computing minimum unsatisfiable cores I Lynce, JP Marques-Silva | 188 | 2004 |
Towards robust CNF encodings of cardinality constraints J Marques-Silva, I Lynce Principles and Practice of Constraint Programming–CP 2007: 13th …, 2007 | 150 | 2007 |
Efficient haplotype inference with Boolean satisfiability I Lynce, J Marques-Silva National conference on artificial intelligence (AAAI), 2006 | 124 | 2006 |
Incremental cardinality constraints for MaxSAT R Martins, S Joshi, V Manquinho, I Lynce Principles and Practice of Constraint Programming: 20th International …, 2014 | 119 | 2014 |
Boolean lexicographic optimization: algorithms & applications J Marques-Silva, J Argelich, A Graça, I Lynce Annals of Mathematics and Artificial Intelligence 62, 317-343, 2011 | 114 | 2011 |
Towards efficient MUS extraction A Belov, I Lynce, J Marques-Silva AI Communications 25 (2), 97-116, 2012 | 111 | 2012 |
Probing-based preprocessing techniques for propositional satisfiability I Lynce, J Marques-Silva Proceedings. 15th IEEE International Conference on Tools with Artificial …, 2003 | 103 | 2003 |
On improving MUS extraction algorithms J Marques-Silva, I Lynce International Conference on Theory and Applications of Satisfiability …, 2011 | 91 | 2011 |
SAT in bioinformatics: Making the case with haplotype inference I Lynce, J Marques-Silva International Conference on Theory and Applications of Satisfiability …, 2006 | 91 | 2006 |
An overview of parallel SAT solving R Martins, V Manquinho, I Lynce Constraints 17, 304-347, 2012 | 83 | 2012 |
Solving linux upgradeability problems using boolean optimization J Argelich, DL Berre, I Lynce, J Marques-Silva, P Rapicault arXiv preprint arXiv:1007.1021, 2010 | 79 | 2010 |
Algorithms for computing backbones of propositional formulae M Janota, I Lynce, J Marques-Silva Ai Communications 28 (2), 161-177, 2015 | 74 | 2015 |
A branch-and-bound algorithm for extracting smallest minimal unsatisfiable formulas M Mneimneh, I Lynce, Z Andraus, J Marques-Silva, K Sakallah Theory and Applications of Satisfiability Testing: 8th International …, 2005 | 69 | 2005 |
Efficient data structures for backtrack search SAT solvers I Lynce, J Marques-Silva Annals of Mathematics and Artificial Intelligence 43, 137-152, 2005 | 67 | 2005 |
On computing backbones of propositional theories J Marques-Silva, M Janota, I Lynce ECAI 2010, 15-20, 2010 | 60 | 2010 |
Categorisation of clauses in conjunctive normal forms: Minimally unsatisfiable sub-clause-sets and the lean kernel O Kullmann, I Lynce, J Marques-Silva Theory and Applications of Satisfiability Testing-SAT 2006: 9th …, 2006 | 57 | 2006 |
Local search for unsatisfiability S Prestwich, I Lynce International conference on theory and applications of satisfiability …, 2006 | 51 | 2006 |