SPASS Version 3.5

@inproceedings{Weidenbach2009SPASSV3,
  title={SPASS Version 3.5},
  author={Christoph Weidenbach and Dilyana Dimova and Arnaud Fietzke and Rohit Kumar and Martin Suda and Patrick Wischnewski},
  booktitle={CADE},
  year={2009}
}
SPASS is an automated theorem prover for full first-order logic with equality and a number of non-classical logics. This system description provides an overview of our recent developments in SPASS 3.5 including subterm contextual rewriting, improved split backtracking, a significantly faster FLOTTER implementation with additional control flags, completely symmetric implementation of forward and backward redundancy criteria, faster parsing with improved support for big files, faster and extended… CONTINUE READING
Highly Influential
This paper has highly influenced 26 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 151 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.
94 Citations
14 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 94 extracted citations

152 Citations

0102030'11'13'15'17
Citations per Year
Semantic Scholar estimates that this publication has 152 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-10 of 14 references

Spass version 3.0

  • Christoph Weidenbach, Renate Schmidt, Thomas Hillenbrand, Rostislav Rusev, Dalibor Topic
  • In 21st International Conference on Automated…
  • 2007

Suttner . The TPTP problem library – cnf release v 1 . 2 . 1

  • Geoff Sutcliffe, B. Christian
  • Journal of Automated Reasoning
  • 2001

Similar Papers

Loading similar papers…