S PASS Version 2.0Open Website

2002 (modified: 26 Apr 2023)CADE 2002Readers: Everyone
Abstract: Spass is an automated theorem prover for full first-order logic with equality. This system description provides an overview of recent developments in Spass 2.0, including among others an implementation of contextual rewriting, refinements of the clause normal form transformation, and enhancements of the inference engine.
0 Replies

Loading