Download all versions of princess-smt-parser_2.11 JAR files with all dependencies
princess-smt-parser_2.11 from group io.github.uuverifiers (version 2024-03-22)
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-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!
princess-smt-parser_2.11 from group io.github.uuverifiers (version 2024-01-12)
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-01-12
Last update 12. January 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-01-12
Last update 12. January 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!
princess-smt-parser_2.11 from group io.github.uuverifiers (version 2023-06-19)
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 2023-06-19
Last update 19. June 2023
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 2023-06-19
Last update 19. June 2023
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!
princess-smt-parser_2.11 from group io.github.uuverifiers (version 2023-04-07)
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 2023-04-07
Last update 04. April 2023
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 2023-04-07
Last update 04. April 2023
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!
princess-smt-parser_2.11 from group io.github.uuverifiers (version 2022-11-03)
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 2022-11-03
Last update 04. November 2022
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 2022-11-03
Last update 04. November 2022
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!
princess-smt-parser_2.11 from group io.github.uuverifiers (version 2022-07-01)
0 downloads
princess-smt-parser_2.11 from group io.github.uuverifiers (version 2022-03-16)
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 2022-03-16
Last update 16. March 2022
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 2022-03-16
Last update 16. March 2022
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!
princess-smt-parser_2.11 from group io.github.uuverifiers (version 2021-11-15)
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 2021-11-15
Last update 15. November 2021
Tags: prover princess solver arithmetic predicates uninterpreted other presburger theorem theories various
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 2021-11-15
Last update 15. November 2021
Tags: prover princess solver arithmetic predicates uninterpreted other presburger theorem theories various
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!
princess-smt-parser_2.11 from group io.github.uuverifiers (version 2021-08-12)
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 2021-08-12
Last update 12. August 2021
Tags: prover princess solver arithmetic predicates uninterpreted other presburger theorem theories various
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 2021-08-12
Last update 12. August 2021
Tags: prover princess solver arithmetic predicates uninterpreted other presburger theorem theories various
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!
princess-smt-parser_2.11 from group io.github.uuverifiers (version 2021-06-28)
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 2021-06-28
Last update 28. June 2021
Tags: prover princess solver arithmetic predicates uninterpreted other presburger theorem theories various
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 2021-06-28
Last update 28. June 2021
Tags: prover princess solver arithmetic predicates uninterpreted other presburger theorem theories various
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 2 (items total 12)