23 lines
869 B
Markdown
23 lines
869 B
Markdown
+++
|
|
date = 2025-06-07
|
|
draft = false
|
|
title = 'SPASS'
|
|
subtitle = 'Theorem Prover'
|
|
links = [
|
|
{ title = "Homepage", url = "https://www.mpi-inf.mpg.de/departments/automation-of-logic/software/spass-workbench/classic-spass-theorem-prover", icon = 'fa-solid fa-home' },
|
|
# { title = "Source Code", url = "https://github.com/abella-prover/abella", icon = 'fa-solid fa-code' },
|
|
# { title = "Playground", url = "https://www.why3.org/try/", icon = 'fa-solid fa-gamepad' }
|
|
]
|
|
applications = ['SMT Solver', 'Theorem Prover', 'SAT Solver']
|
|
developers = ['Inria']
|
|
licenses = ['All Rights Reserved']
|
|
inputs = ['WhyML']
|
|
interfaces = ['CLI', 'Why3']
|
|
maintenance = ['Actively Maintained']
|
|
# techniques = ['CDCL']
|
|
# publications = ['deMoura2008']
|
|
+++
|
|
|
|
{{<closed-source>}}
|
|
<!-- {{<inactive year="2011">}} -->
|
|
SPASS: An Automated Theorem Prover for First-Order Logic with Equality |