Download princess-smt-parser_2.11 JAR file with all dependencies
princess-smt-parser_2.11 from group io.github.uuverifiers (version 2024-11-08)
Princess is a theorem prover (aka SMT Solver) for Presburger arithmetic, uninterpreted predicates, and various other theories.
0 downloads
Artifact princess-smt-parser_2.11
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!
Page 1 from 1 (items total 1)