Download princess-parser_2.12 JAR 2024-11-08 with all dependencies
Princess is a theorem prover (aka SMT Solver) for Presburger arithmetic, uninterpreted predicates, and various other theories.
Files of the artifact princess-parser_2.12 version 2024-11-08 from the group io.github.uuverifiers.
Artifact princess-parser_2.12
Group io.github.uuverifiers
Version 2024-11-08
Last update 08. November 2024
Tags: theorem predicates other uninterpreted various theories arithmetic princess presburger prover solver
Organization io.github.uuverifiers
URL https://philipp.ruemmer.org/princess.shtml
License BSD-3-Clause
Dependencies amount 1
Dependencies scala-library,
There are maybe transitive dependencies!
Group io.github.uuverifiers
Version 2024-11-08
Last update 08. November 2024
Tags: theorem predicates other uninterpreted various theories arithmetic princess presburger prover solver
Organization io.github.uuverifiers
URL https://philipp.ruemmer.org/princess.shtml
License BSD-3-Clause
Dependencies amount 1
Dependencies scala-library,
There are maybe transitive dependencies!
The newest version!
Show all versions of princess-parser_2.12 Show documentation
Please rate this JAR file. Is it a good library?
0 downloads
Source code of princess-parser_2.12 version 2024-11-08
META-INF
© 2015 - 2024 Weber Informatics LLC | Privacy Policy