| Combining clause learning and branch and bound for MaxSAT CM Li, Z Xu, J Coll, F Manyà, D Habet, K He 27th International Conference on Principles and Practice of Constraint …, 2021 | 67 | 2021 |
| SMT encodings for Resource-Constrained Project Scheduling Problems M Bofill, J Coll, J Suy, M Villaret Computers & Industrial Engineering 149, 106777, 2020 | 36 | 2020 |
| Boosting branch-and-bound MaxSAT solvers with clause learning CM Li, Z Xu, J Coll, F Manyà, D Habet, K He AI Communications 35 (2), 131-151, 2022 | 34 | 2022 |
| Constraint Solving Approaches to the Business-to-Business Meeting Scheduling Problem M Bofill, J Coll, M Garcia, J Giráldez-Cru, G Pesant, J Suy, M Villaret Journal of Artificial Intelligence Research 74, 263-301, 2022 | 23 | 2022 |
| Compact MDDs for Pseudo-Boolean Constraints with At-Most-One Relations in Resource-Constrained Scheduling Problems. M Bofill, J Coll, J Suy, M Villaret IJCAI, 555-562, 2017 | 21 | 2017 |
| SAT encodings for Pseudo-Boolean constraints together with at-most-one constraints M Bofill, J Coll, P Nightingale, J Suy, F Ulrich-Oltean, M Villaret Artificial Intelligence 302, 103604, 2022 | 20 | 2022 |
| Automatic detection of at-most-one and exactly-one relations for improved SAT encodings of pseudo-boolean constraints C Ansótegui, M Bofill, J Coll, N Dang, JL Esteban, I Miguel, P Nightingale, ... International Conference on Principles and Practice of Constraint …, 2019 | 19 | 2019 |
| Solving the multi-mode resource-constrained project scheduling problem with SMT M Bofill, J Coll, J Suy, M Villaret 2016 IEEE 28th International Conference on Tools with Artificial …, 2016 | 18 | 2016 |
| An MDD-based SAT encoding for pseudo-Boolean constraints with at-most-one relations M Bofill, J Coll, J Suy, M Villaret Artificial Intelligence Review 53 (7), 5157-5188, 2020 | 13 | 2020 |
| SAT encodings of pseudo-boolean constraints with at-most-one relations M Bofill, J Coll, J Suy, M Villaret International Conference on Integration of Constraint Programming …, 2019 | 13 | 2019 |
| An efficient SMT approach to solve MRCPSP/max instances with tight constraints on resources M Bofill, J Coll, J Suy, M Villaret International Conference on Principles and Practice of Constraint …, 2017 | 10 | 2017 |
| Context-aware case-based reasoning A Pla, J Coll, N Mordvaniuk, B López Mining Intelligence and Knowledge Exploration: Second International …, 2014 | 8 | 2014 |
| Towards lifted encodings for numeric planning in Essence Prime J Espasa, J Coll, I Miguel, M Villaret CP 2019 Workshop on Constraint Modelling and Reformulation, 2019 | 7 | 2019 |
| Certified Branch-and-Bound MaxSAT Solving D Vandesande, J Coll, CM Li, B Bogaerts | 6 | 2024 |
| MaxSAT resolution for regular propositional logic J Coll, CM Li, F Manyà, E Yangin International Journal of Approximate Reasoning 162, 109010, 2023 | 6 | 2023 |
| Improving the Lower Bound in Branch-and-Bound Algorithms for MaxSAT S Li, CM Li, J Coll, D Habet, F Manyà Proceedings of the AAAI Conference on Artificial Intelligence 39 (11), 11272 …, 2025 | 5 | 2025 |
| Maxcdcl in maxsat evaluation 2023 CM Li, J Coll, S Li, D Habet, F Manya, K He MaxSAT Evaluation 2023, 14-15, 2023 | 5 | 2023 |
| Wmaxcdcl in maxsat evaluation 2023 J Coll, S Li, CM Li, F Manya, D Habet, MS Cherif, K He MaxSAT Evaluation 2023, 16-17, 2023 | 5 | 2023 |
| The Sample Analysis Machine Scheduling Problem: Definition and comparison of exact solving approaches M Bofill, J Coll, G Martín, J Suy, M Villaret Computers & Operations Research 142, 105730, 2022 | 5 | 2022 |
| Optimizing resource allocation in home care services using MaxSAT I Unceta, B Salbanya, J Coll, M Villaret, J Nin Cognitive Systems Research 88, 101291, 2024 | 4 | 2024 |
Mateu Villaret AuselleUniversitat de GironaVerified email at ima.udg.edu
