SPASS is an
automated theorem prover
Automated theorem proving (also known as ATP or automated deduction) is a subfield of automated reasoning and mathematical logic dealing with proving mathematical theorems by computer programs. Automated reasoning over mathematical proof was a ma ...
for
first-order logic with equality developed at the
Max Planck Institute for Computer Science and using the
superposition calculus. The name originally stood for ''Synergetic Prover Augmenting Superposition with Sorts''. The theorem proving system is released under the
FreeBSD license.
An extension of SPASS called SPASS-XDB added support for on-the-fly retrieval of positive unit axioms from external sources. SPASS-XDB can thus incorporate facts coming from
relational database
A relational database is a (most commonly digital) database based on the relational model of data, as proposed by E. F. Codd in 1970. A system used to maintain relational databases is a relational database management system (RDBMS). Many relatio ...
s,
web services, or
linked data
In computing, linked data (often capitalized as Linked Data) is structured data which is interlinked with other data so it becomes more useful through semantic queries. It builds upon standard Web technologies such as HTTP, RDF and URIs, but ...
servers. Support for arithmetic using
Mathematica
Wolfram Mathematica is a software system with built-in libraries for several areas of technical computing that allow machine learning, statistics, symbolic computation, data manipulation, network analysis, time series analysis, NLP, optimi ...
was also added.
References
Sources
*.
External links
*{{Official website, www.spass-prover.org
Free theorem provers
Unix programming tools
Max Planck Institute for Informatics