META-INF.MANIFEST.MF Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of princess-smt-parser_2.11 Show documentation
Show all versions of princess-smt-parser_2.11 Show documentation
Princess is a theorem prover (aka SMT Solver) for Presburger arithmetic, uninterpreted predicates, and various other theories.
The newest version!
Manifest-Version: 1.0
Specification-Vendor: io.github.uuverifiers
Specification-Title: Princess-smt-parser
Specification-Version: 2024-11-08