| 2025 | AAAI | Improving the Lower Bound in Branch-and-Bound Algorithms for MaxSAT. | Shuolin Li, Chu-Min Li, Jordi Coll, Djamal Habet, Felip Many |
| 2023 | IJCAI | A New Variable Ordering for In-processing Bounded Variable Elimination in SAT Solvers. | Shuolin Li, Chu-Min Li, Mao Luo, Jordi Coll, Djamal Habet, Felip Many |
| 2023 | TABLEAUX | The MaxSAT Problem in the Real-Valued MV-Algebra. | Zuzana Hanikov, Felip Many, Amanda Vidal |
| 2022 | IJCAI | Combining Clause Learning and Branch and Bound for MaxSAT (Extended Abstract). | Chu-Min Li, Zhenxing Xu, Jordi Coll, Felip Many, Djamal Habet, Kun He |
| 2022 | IJCAI | BandMaxSAT: A Local Search MaxSAT Solver with Multi-armed Bandit. | Jiongzhi Zheng, Kun He, Jianrong Zhou, Yan Jin, Chu-Min Li, Felip Many |
| 2021 | CP | Combining Clause Learning and Branch and Bound for MaxSAT. | Chu-Min Li, Zhenxing Xu, Jordi Coll, Felip Many, Djamal Habet, Kun He |
| 2019 | TABLEAUX | A Tableau Calculus for Non-clausal Maximum Satisfiability. | Chu Min Li, Felip Many, Joan Ramon Soler |
| 2018 | AAAI | A Two-Stage MaxSAT Reasoning Approach for the Maximum Weight Clique Problem. | Hua Jiang, Chu-Min Li, Yanli Liu, Felip Many |
| 2017 | AAAI | An Exact Algorithm for the Maximum Weight Clique Problem in Large Graphs. | Hua Jiang, Chu-Min Li, Felip Many |
| 2017 | IJCAI | An Effective Learnt Clause Minimization Approach for CDCL SAT Solvers. | Mao Luo, Chu-Min Li, Fan Xiao, Felip Many, Zhipeng L |
| 2016 | ECAI | Combining Efficient Preprocessing and Incremental MaxSAT Reasoning for MaxClique in Large Graphs. | Hua Jiang, Chu Min Li, Felip Many |
| 2016 | IJCAI | A Clause Tableau Calculus for MaxSAT. | Chu Min Li, Felip Many, Joan Ramon Soler |
| 2015 | IJCAI | An Exact Inference Scheme for MinSAT. | Chu Min Li, Felip Many |
| 2015 | MDAI | The Complexity of 3-Valued Łukasiewicz Rules. | Miquel Bofill, Felip Many, Amanda Vidal, Mateu Villaret |
| 2013 | CP | MinSAT versus MaxSAT for Optimization Problems. | Josep Argelich, Chu Min Li, Felip Many, Zhu Zhu |
| 2012 | AAAI | The Automated Vacuum Waste Collection Optimization Problem. | Ramn Bjar, Csar Fernndez, Carles Mateu, Felip Many, Francina Sole-Mauri, David Vidal |
| 2012 | CP | A New Encoding from MinSAT into MaxSAT. | Zhu Zhu, Chu Min Li, Felip Many, Josep Argelich |
| 2012 | ICTAI | Optimizing Energy Consumption in Automated Vacuum Waste Collection Systems. | Ramn Bjar, Csar Fernndez, Felip Many, Carles Mateu, Francina Sole-Mauri |
| 2011 | IJCAI | Minimum Satisfiability and Its Applications. | Chu Min Li, Zhu Zhu, Felip Many, Laurent Simon |
| 2011 | SAT | Analyzing the Instances of the MaxSAT Evaluation. | Josep Argelich, Chu Min Li, Felip Many, Jordi Planes |
| 2010 | SAT | Exact MinSAT Solving. | Chu Min Li, Felip Many, Zhe Quan, Zhu Zhu |
| 2009 | SAT | Sequential Encodings from Max-CSP into Partial Max-SAT. | Josep Argelich, Alba Cabiscol, Ins Lynce, Felip Many |
| 2009 | SAT | Exploiting Cycle Structures in Max-SAT. | Chu Min Li, Felip Many, Nouredine Ould Mohamedou, Jordi Planes |
| 2008 | AAAI | Measuring the Hardness of SAT Instances. | Carlos Anstegui, Maria Luisa Bonet, Jordi Levy, Felip Many |
| 2008 | CP | Transforming Inconsistent Subformulas in MaxSAT Lower Bound Computation. | Chu Min Li, Felip Many, Nouredine Ould Mohamedou, Jordi Planes |
| 2008 | SAT | Modelling Max-CSP as Partial Max-SAT. | Josep Argelich, Alba Cabiscol, Ins Lynce, Felip Many |
| 2008 | SAT | A Preprocessor for Max-SAT Solvers. | Josep Argelich, Chu Min Li, Felip Many |
| 2007 | AAAI | Inference Rules for High-Order Consistency in Weighted CSP. | Carlos Anstegui, Maria Luisa Bonet, Jordi Levy, Felip Many |
| 2007 | IJCAI | The Logic Behind Weighted CSP. | Carlos Anstegui, Maria Luisa Bonet, Jordi Levy, Felip Many |
| 2007 | SAT | Mapping CSP into Many-Valued SAT. | Carlos Anstegui, Maria Luisa Bonet, Jordi Levy, Felip Many |
| 2007 | SAT | Partial Max-SAT Solvers with Clause Learning. | Josep Argelich, Felip Many |
| 2006 | AAAI | Detecting Disjoint Inconsistent Subformulas for Computing Lower Bounds for Max-SAT. | Chu Min Li, Felip Many, Jordi Planes |
| 2006 | SAT | A Complete Calculus for Max-SAT. | Maria Luisa Bonet, Jordi Levy, Felip Many |
| 2005 | CP | Solving Over-Constrained Problems with SAT. | Josep Argelich, Felip Many |
| 2005 | CP | Exploiting Unit Propagation to Compute Lower Bounds in Branch and Bound Max-SAT Solvers. | Chu Min Li, Felip Many, Jordi Planes |
| 2005 | SAT | Improved Exact Solvers for Weighted Max-SAT. | Teresa Alsinet, Felip Many, Jordi Planes |
| 2005 | SAT | Solving Over-Constrained Problems with SAT Technology. | Josep Argelich, Felip Many |
| 2004 | AAAI | Modeling Choices in Quasigroup Completion: SAT vs. CSP. | Carlos Anstegui, Alvaro del Val, Ivn Dot, Csar Fernndez, Felip Many |
| 2004 | SAT | Mapping Problems with Finite-Domain Variables into Problems with Boolean Variables. | Carlos Anstegui, Felip Many |
| 2004 | SAT | Mapping Problems with Finite-Domain Variables to Problems with Boolean Variables. | Carlos Anstegui, Felip Many |
| 2003 | CP | Boosting Chaff's Performance by Incorporating CSP Heuristics. | Carlos Anstegui, Jose Larrubia, Felip Many |
| 2002 | CP | Bridging the Gap between SAT and CSP. | Carlos Anstegui, Felip Many |
| 2001 | CP | Capturing Structure with Satisfiability. | Ramn Bjar, Alba Cabiscol, Csar Fernndez, Felip Many, Carla P. Gomes |
| 2000 | AAAI | Solving the Round Robin Problem Using Propositional Logic. | Ramn Bjar, Felip Many |
| 1999 | ECSQARU | A Comparison of Systematic and Local Search Algorithms for Regular CNF Formulas. | Ramn Bjar, Felip Many |
| 1999 | ISMIS | Phase Transitions in the Regular Random 3-SAT Problem. | Ramn Bjar, Felip Many |
| 1999 | LPAR | Solving Combinatorial Problems with Regular Local Search Algorithms. | Ramn Bjar, Felip Many |
| 1994 | IPMU | Efficient Interpretation of Propositional Multiple-valued Logic Programs. | Gonzalo Escalada-Imaz, Felip Many |