Princess is a theorem prover (aka SMT Solver) for Presburger arithmetic, uninterpreted predicates, and various other theories.
License | BSD 3-clause |
---|---|
Tags | github |
HomePage | https://philipp.ruemmer.org/princess.shtml |
Ranking | #108732 in MvnRepository (See Top Artifacts) |
Used By | 4 artifacts |
Version ▼ | Scala | Vulnerabilities | Repository | Usages | Date | |
---|---|---|---|---|---|---|
.x | 2025-04-01 | 2.13 2.12 2.11 | Central | Apr 02, 2025 | ||
2024-11-08 | 2.13 2.12 2.11 | Central | Nov 08, 2024 | |||
2024-03-22 | 2.13 2.12 2.11 | Central | Mar 21, 2024 | |||
2024-01-12 | 2.13 2.12 2.11 | Central | Jan 12, 2024 | |||
2023-06-19 | 2.13 2.12 2.11 | Central | Jun 19, 2023 | |||
2023-04-07 | 2.13 2.12 2.11 | Central |
0
| Apr 04, 2023 | ||
2022-11-03 | 2.13 2.12 2.11 | Central | Nov 04, 2022 | |||
2022-07-01 | 2.13 2.12 2.11 | Central | Jul 01, 2022 | |||
2022-03-16 | 2.13 2.12 2.11 | Central |
0
| Mar 16, 2022 | ||
2021-11-15 | 2.13 2.12 2.11 | Central | Nov 15, 2021 | |||
2021-08-12 | 2.13 2.12 2.11 | Central | Aug 12, 2021 | |||
2021-06-28 | 2.13 2.12 2.11 | Central |
0
| Jun 28, 2021 | ||
2021-05-10 | 2.13 2.12 2.11 | Central | May 10, 2021 | |||
2021-04-09 | 2.13 2.12 2.11 | Central |
0
| Apr 12, 2021 |