| On computing minimal correction subsets J Marques-Silva, F Heras, M Janota, A Previti, A Belov Twenty-Third International Joint Conference on Artificial Intelligence, 2013 | 147 | 2013 |
| Fast, flexible MUS enumeration MH Liffiton, A Previti, A Malik, J Marques-Silva Constraints 21 (2), 223-250, 2016 | 110 | 2016 |
| Literal-based MCS extraction C Mencía, A Previti, J Marques-Silva Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015 | 58 | 2015 |
| Partial MUS enumeration A Previti, J Marques-Silva Proceedings of the AAAI Conference on Artificial Intelligence 27 (1), 2013 | 53 | 2013 |
| Smallest MUS extraction with minimal hitting set dualization A Ignatiev, A Previti, M Liffiton, J Marques-Silva International Conference on Principles and Practice of Constraint …, 2015 | 47 | 2015 |
| Prime Compilation of Non-Clausal Formulae A Previti, A Ignatiev, A Morgado, J Marques-Silva International Joint Conference on Artificial Intelligence, 2015 | 32 | 2015 |
| MCS extraction with sublinear oracle queries C Mencía, A Ignatiev, A Previti, J Marques-Silva International Conference on Theory and Applications of Satisfiability …, 2016 | 17 | 2016 |
| Premise set caching for enumerating minimal correction subsets A Previti, C Mencia, M Järvisalo, J Marques-Silva Proceedings of the AAAI Conference on Artificial Intelligence 32 (1), 2018 | 14 | 2018 |
| Improving MCS enumeration via caching A Previti, C Mencía, M Järvisalo, J Marques-Silva International Conference on Theory and Applications of Satisfiability …, 2017 | 14 | 2017 |
| On computing preferred MUSes and MCSes J Marques-Silva, A Previti International Conference on Theory and Applications of Satisfiability …, 2014 | 13 | 2014 |
| Monte-carlo style uct search for boolean satisfiability A Previti, R Ramanujan, M Schaerf, B Selman Congress of the Italian Association for Artificial Intelligence, 177-188, 2011 | 10 | 2011 |
| Cautious reasoning in ASP via minimal models and unsatisfiable cores M Alviano, C Dodaro, M Järvisalo, M Maratea, A Previti Theory and Practice of Logic Programming 18 (3-4), 319-336, 2018 | 9 | 2018 |
| SAT-based formula simplification A Ignatiev, A Previti, J Marques-Silva International Conference on Theory and Applications of Satisfiability …, 2015 | 7 | 2015 |
| A portfolio approach to enumerating minimal correction subsets for satisfiability problems Y Malitsky, B O’Sullivan, A Previti, J Marques-Silva International Conference on AI and OR Techniques in Constriant Programming …, 2014 | 7 | 2014 |
| Applying UCT to boolean satisfiability A Previti, R Ramanujan, M Schaerf, B Selman International Conference on Theory and Applications of Satisfiability …, 2011 | 6 | 2011 |
| A preference-based approach to backbone computation with application to argumentation A Previti, M Järvisalo Proceedings of the 33rd Annual ACM Symposium on Applied Computing, 896-902, 2018 | 4 | 2018 |
| SAT-based Horn least upper bounds C Mencía, A Previti, J Marques-Silva International Conference on Theory and Applications of Satisfiability …, 2015 | 4 | 2015 |
| On Computing Generalized Backbones A Previti, A Ignatiev, M Järvisalo, J Marques-Silva 2017 IEEE 29th International Conference on Tools with Artificial …, 2017 | 2 | 2017 |
| On finding minimum satisfying assignments A Ignatiev, A Previti, J Marques-Silva International Conference on Principles and Practice of Constraint …, 2016 | 2 | 2016 |
| Timeout-Sensitive Portfolio Approach to Enumerating Minimal Correction Subsets for Satisfiability Problems Y Malitsky, B O'Sullivan, A Previti, J Marques-Silva European Conference on Artificial Intelligence, 2014 | 2 | 2014 |
Joao Marques-SilvaCNRS Research Director, IRIT, CNRS & ANITIDirección de correo verificada de irit.fr
