Princess

Submitted by on Jun 18 2014 } Suggest Revision
By:
Project: http://www.philipp.ruemmer.org/princess....
From: Uppsala University
Paper:
Resource Type:
Code
License:
GNU General Public License
Language:
Java
Data Format:

Description

Princess is a theorem prover for Presburger arithmetic with uninterpreted predicates.
Categorized in: Representation and Reasoning | Automated Theorem Proving
Post comment
Cancel