| Group | io.github.uuverifiers |
| 描述 | Princess is a theorem prover (aka SMT Solver) for Presburger arithmetic, uninterpreted predicates, and various other theories. |
| 版本 | 仓库 | 发布时间 |
| 2024-03-22 | central | 2024-03-21 18:52 |
| 2024-01-12 | central | 2024-01-12 15:55 |
| 2023-06-19 | central | 2023-06-19 22:30 |
| 2023-04-07 | central | 2023-04-04 18:15 |
| 2022-11-03 | central | 2022-11-05 02:56 |
| 2022-07-01 | central | 2022-07-01 17:56 |
| 2022-03-16 | central | 2022-03-16 19:10 |
| 2021-11-15 | central | 2021-11-15 18:50 |
| 2021-08-12 | central | 2021-08-13 00:09 |
| 2021-06-28 | central | 2021-06-28 17:19 |
| 2021-05-10 | central | 2021-05-10 15:47 |
| 2021-04-09 | central | 2021-04-12 21:41 |
| 仓库 | 个数 |
| Central | 592045 |