Download princess-smt-parser_2.11 JAR 2024-03-22 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-smt-parser_2.11 version 2024-03-22 from the group io.github.uuverifiers.
Artifact princess-smt-parser_2.11
Group io.github.uuverifiers
Version 2024-03-22
Last update 21. March 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-03-22
Last update 21. March 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!
There is a newer version: 2024-11-08
Show newest versionShow all versions of princess-smt-parser_2.11 Show documentation
Please rate this JAR file. Is it a good library?
0 downloads
Source code of princess-smt-parser_2.11 version 2024-03-22
Please wait ...