Painless: a Framework for Parallel SAT Solving L Le Frioux, S Baarir, J Sopena, F Kordon Proceedings of the 20th International Conference on Theory and Applications …, 2017 | 69 | 2017 |
Modular and Efficient Divide-and-Conquer SAT Solver on Top of the Painless Framework L Le Frioux, S Baarir, J Sopena, F Kordon Proceedings of the 25th International Conference on Tools and Algorithms for …, 2019 | 27 | 2019 |
New Concurrent and Distributed Painless solvers: P-MCOMSPS, P-MCOMSPS-COM, P-MCOMSPS-MPI, and P-MCOMSPS-COM-MPI V Vallade, L Le Frioux, R Oanea, S Baarir, J Sopena, F Kordon, S Nejati, ... Proceedings of the SAT Competition 2021: Solver and Benchmark Descriptions, 40, 2021 | 10 | 2021 |
A machine learning based splitting heuristic for divide-and-conquer solvers S Nejati, L Le Frioux, V Ganesh Proceedings of the 26th International Conference on Principles and Practice …, 2020 | 10 | 2020 |
Community and LBD-based Clause Sharing Policy for Parallel SAT Solving V Vallade, L Le Frioux, S Baarir, J Sopena, V Ganesh, F Kordon Proceedings of the 23rd International Conference on Theory and Applications …, 2020 | 10 | 2020 |
On the Usefulness of Clause Strengthening in Parallel SAT Solving V Vallade, L Le Frioux, S Baarir, J Sopena, F Kordon Proceedings of the 12th NASA Formal Methods Symposium (NFM), 2020 | 5 | 2020 |
P-MCOMSPS-STR: a Painless-based Portfolio of MapleCOMSPS with Clause Strengthening. V Vallade, L Le Frioux, S Baarir, J Sopena, F Kordon Proceedings of SAT Competition 2020: Solver and Benchmark Descriptions, 56-57, 2020 | 1 | 2020 |
Towards more efficient parallel SAT solving L Le Frioux Sorbonne Université, 2019 | 1 | 2019 |
painless-mcomsps and painless-mcomsps-sym L Le Frioux, H Metin, S Baarir, M Colange, J Sopena, F Kordon Proceedings of the SAT Competition 2018: Solver and Benchmark Descriptions, 33, 2018 | 1 | 2018 |
painless-maplecomsps L Le Frioux, S Baarir, J Sopena, F Kordon Proceedings of the SAT Competition 2017: Solver and Benchmark Descriptions, 26, 2017 | 1* | 2017 |