Skip to content

List of implemented Plugins

In this page we show the list of all the currently available Plugins in Paramita. For each plugin, we specify:

  • Its name, version, citation and a link to the plugin source code.
  • The installation URL to be used with the Paramita CLI.
  • The extra instructions required to compile the plugin (if any).
  • The original project URL.

Plugin Installation

You can install any of the listed plugins using the CLI helper:

paramita plugins build cmake <Installation URL>

For more information you can check the Building an external Plugin section.

Danger

Never run these commands on untrusted sources. The compile process might run arbitrary commands in your machine.

Always check for the sources before running them.

Citing

If you use any plugin, please cite the project authors alongside with Paramita.

paramita.solvers.SatSolver

Name Installation URL Instructions Project URL
Cadical (1.9.5)1 #sat-solvers/cadical-1.9.5 - Link
Cadical (2.0.0)1 #sat-solvers/cadical-2.0.0 - Link
Cadical (2.1.3)1 #sat-solvers/cadical-2.1.3 - Link
Cadical (2.2.1)1 #sat-solvers/cadical-2.2.1 - Link
Cadical (3.0.0)1 #sat-solvers/cadical-3.0.0 - Link
Cadical (SAT Comp. 2025)1 #sat-solvers/sc25-cadical-sc2025 - Link
Glucose (4.1)2 #sat-solvers/glucose-4.1 - Link
Glucose (4.2.1)2 #sat-solvers/glucose-4.2.1 Yes Link
Intel SAT (MSE2024)3 #sat-solvers/intelsat-mse24 - Link
Maple Glucose (73b36d3)4 #sat-solvers/mapleglucose-core-73b36d3 Yes Link
Maple SAT (73b36d3)5 #sat-solvers/maplesat-core-73b36d3 Yes Link
Mergesat (4.0-rc4)6 #sat-solvers/mergesat-4.0-rc4 - Link
Picosat (9.6.5)7 #sat-solvers/picosat-9.6.5 - Link

paramita.solvers.NonIncrSatSolver

Name Installation URL Instructions Project URL
CominisatPS (SAT Comp. 2016)8 #non-incr-sat-solvers/sc16-cominisatps Yes Link
Kissat (3.1.1)9 #non-incr-sat-solvers/kissat-3.1.1 - Link
Kissat (4.0.1)9 #non-incr-sat-solvers/kissat-4.0.1 - Link
Kissat (SAT Comp. 2024)9 #non-incr-sat-solvers/sc24-kissat-sc2024 - Link
Kissat-MAB-ESA (SAT Comp. 2024)10 #non-incr-sat-solvers/kissat_MAB_ESA - Link
Kissat-MAB-DC (SAT Comp. 2024)11 #non-incr-sat-solvers/kissat_MAB_DC - Link

paramita.solvers.MaxSatSolver

Name Installation URL Instructions Project URL
CGSS2 (89c3b17)12 #maxsat-solvers/cgss2-89c3b17 - Link
EvalMaxSAT (MSE2022)13 #maxsat-solvers/mse22-EvalMaxSAT2022 Yes Link
iMaxHS (MSE2022)14 #maxsat-solvers/mse22-iMaxHS Yes Link
UWrMaxSat (MSE2022)15 #maxsat-solvers/mse22-uwrmaxsat14 Yes Link
UWrMaxSat (1.8.0)15 #maxsat-solvers/uwrmaxsat Yes Link

paramita.solvers.NonIncrMaxSatSolver

Name Installation URL Instructions Project URL
MaxCDCL (MSE2024)16 #non-incr-maxsat-solvers/mse24-maxcdcl Yes Link
OpenWBO (MSE2024)17 #non-incr-maxsat-solvers/mse24-openwbo Yes Link
TT-OpenWBO-Inc (5881d2d)18 #non-incr-maxsat-solvers/tt-openwbo-inc-5881d2d Yes Link
WMaxCDCL (MSE2024)19 #non-incr-maxsat-solvers/mse24-wmaxcdcl Yes Link

paramita.encoders.PbToCnfEncoder

Name Installation URL Instructions Project URL
PBLib20 #pb-to-cnf-encoders/pblib - Link
PySAT21 #pb-to-cnf-encoders/pysat - Link

  1. Armin Biere, Tobias Faller, Katalin Fazekas, Mathias Fleury, Nils Froleyks, and Florian Pollitt. Cadical 2.0. In Arie Gurfinkel and Vijay Ganesh, editors, Computer Aided Verification, 133–152. Cham, 2024. Springer Nature Switzerland. ↩↩↩↩↩↩

  2. Gilles Audemard and Laurent Simon. Predicting learnt clauses quality in modern sat solvers. In Proceedings of the 21st International Joint Conference on Artificial Intelligence, IJCAI'09, 399–404. San Francisco, CA, USA, 2009. Morgan Kaufmann Publishers Inc. ↩↩

  3. Alexander Nadel. Solving huge instances with intel(r) SAT solver. In Meena Mahajan and Friedrich Slivovsky, editors, 26th International Conference on Theory and Applications of Satisfiability Testing, SAT 2023, Alghero, Italy, July 4-8, 2023, LIPIcs, 17:1–17:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023. URL: https://doi.org/10.4230/LIPIcs.SAT.2023.17, doi:10.4230/LIPICS.SAT.2023.17. ↩

  4. Jia Hui Liang, Vijay Ganesh, Krzysztof Czarnecki, and Pascal Poupart. Mapleglucose and maplecms. SAT COMPETITION 2016, pages 50, 2016. ↩

  5. Jia Hui Liang, Vijay Ganesh, Pascal Poupart, and Krzysztof Czarnecki. Learning rate based branching heuristic for sat solvers. In Nadia Creignou and Daniel Le Berre, editors, Theory and Applications of Satisfiability Testing – SAT 2016, 123–140. Cham, 2016. Springer International Publishing. ↩

  6. Norbert Manthey. The mergesat solver. In Chu-Min Li and Felip Manyà, editors, Theory and Applications of Satisfiability Testing – SAT 2021, 387–398. Cham, 2021. Springer International Publishing. URL: https://doi.org/10.1007/978-3-030-80223-3\_27. ↩

  7. Armin Biere. Picosat essentials. Journal on Satisfiability, Boolean Modelling and Computation, 4(2-4):75–97, 2008. ↩

  8. Chanseok Oh. Cominisatps the chandrasekhar limit and ghackcomsps,”. SAT Competition, 2016. ↩

  9. Armin Biere, Katalin Fazekas, Mathias Fleury, and Maximilian Heisinger. Cadical, kissat, paracooba, plingeling and treengeling entering the sat competition 2020. In \Tomas Balyo, Nils Froleyks, Marijn Heule, Markus Iser, Matti Järvisalo, Martin Suda\, editor, Proc. of SAT Competition 2020 - Solver and Benchmark Descriptions, volume vol. B-2020-1 of Department of Computer Science Report Series B, 50–53. University of Helsinki, 2020. ↩↩↩

  10. S Li, CM Li, M Luo, J Coll, MS Cherif, D Habet, and F Manyà. Esa solvers, kissat mab binary and amsat in sat competition 2024. Proceedings of SAT Competition 2024, 2024. ↩

  11. Jinjin Liu, Jianmin Zhang, and Yan Sun. Kissat mab-dc in sat competition 2024. SAT COMPETITION 2024, pages 20, 2024. ↩

  12. Hannes Ihalainen, Jeremias Berg, and Matti Järvisalo. Refined Core Relaxation for Core-Guided MaxSAT Solving. In Laurent D. Michel, editor, 27th International Conference on Principles and Practice of Constraint Programming (CP 2021), volume 210 of Leibniz International Proceedings in Informatics (LIPIcs), 28:1–28:19. Dagstuhl, Germany, 2021. Schloss Dagstuhl – Leibniz-Zentrum für Informatik. URL: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2021.28, doi:10.4230/LIPIcs.CP.2021.28. ↩

  13. Matti Järvisalo, Jeremias Berg, Fahiem Bacchus, Ruben Martins, and Andreas Niskanen. Evalmaxsat 2022 repository. 2022. Repository for the 2022 MaxSAT Evaluation used in MaxSAT competitions. URL: https://github.com/normal-account/EvalMaxSAT2022. ↩

  14. Andreas Niskanen, Jeremias Berg, and Matti Järvisalo. Enabling Incrementality in the Implicit Hitting Set Approach to MaxSAT Under Changing Weights. In Laurent D. Michel, editor, 27th International Conference on Principles and Practice of Constraint Programming (CP 2021), volume 210 of Leibniz International Proceedings in Informatics (LIPIcs), 44:1–44:19. Dagstuhl, Germany, 2021. Schloss Dagstuhl – Leibniz-Zentrum für Informatik. URL: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2021.44, doi:10.4230/LIPIcs.CP.2021.44. ↩

  15. Marek Piotrów. Uwrmaxsat: efficient solver for maxsat and pseudo-boolean problems. In 2020 IEEE 32nd International Conference on Tools with Artificial Intelligence (ICTAI), volume, 132–136. 2020. doi:10.1109/ICTAI50040.2020.00031. ↩↩

  16. Chu-Min Li, Zhenxing Xu, Jordi Coll, Felip Manyà, Djamal Habet, and Kun He. Boosting branch-and-bound maxsat solvers with clause learning. AI Communications, 35(2):131–151, 2022. URL: https://journals.sagepub.com/doi/abs/10.3233/AIC-210178, arXiv:https://journals.sagepub.com/doi/pdf/10.3233/AIC-210178, doi:10.3233/AIC-210178. ↩

  17. Ruben Martins, Vasco Manquinho, and Inês Lynce. Open-wbo: a modular maxsat solver,. In Carsten Sinz and Uwe Egly, editors, Theory and Applications of Satisfiability Testing – SAT 2014, 438–445. Cham, 2014. Springer International Publishing. ↩

  18. Alexander Nadel. Tt-open-wbo-inc: an efficient anytime maxsat solver. Journal on Satisfiability, Boolean Modeling and Computation, 15:1–7, 09 2024. doi:10.3233/SAT-231504. ↩

  19. Jordi Coll, Chu-Min Li, Shuolin Li, Djamal Habet, and Felip Manyà. Solving weighted maximum satisfiability with branch and bound and clause learning. Computers & Operations Research, 183:107195, 2025. URL: https://www.sciencedirect.com/science/article/pii/S0305054825002230, doi:https://doi.org/10.1016/j.cor.2025.107195. ↩

  20. Tobias Philipp and Peter Steinke. Pblib – a library for encoding pseudo-boolean constraints into cnf. In Marijn Heule and Sean Weaver, editors, Theory and Applications of Satisfiability Testing – SAT 2015, volume 9340 of Lecture Notes in Computer Science, pages 9–16. Springer International Publishing, 2015. doi:10.1007/978-3-319-24318-4_2. ↩

  21. Alexey Ignatiev, Zi Li Tan, and Christos Karamanos. Towards Universally Accessible SAT Technology. In Supratik Chakraborty and Jie-Hong Roland Jiang, editors, 27th International Conference on Theory and Applications of Satisfiability Testing (SAT 2024), volume 305 of Leibniz International Proceedings in Informatics (LIPIcs), 16:1–16:11. Dagstuhl, Germany, 2024. Schloss Dagstuhl – Leibniz-Zentrum für Informatik. URL: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAT.2024.16, doi:10.4230/LIPIcs.SAT.2024.16. ↩