Skip to search formSkip to main contentSkip to account menu

SPASS

Known as: SPASS theorem prover, Synergetic Prover Augmenting Superposition with Sorts 
SPASS is an automated theorem prover for first-order logic with equality developed at the Max Planck Institute for Computer Science and using the… 
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Nowadays, xylene is not only one major air pollutant which threats human health even if its concentration is lower than the human… 
Review
2009
Review
2009
SPASS is an automated theorem prover for full first-order logic with equality and a number of non-classical logics. This system… 
Highly Cited
2007
Highly Cited
2007
An electrophotographic copying system is disclosed wherein the DC charging and DC transfer corotrons are powered with an… 
Highly Cited
2006
Highly Cited
2006
Highly Cited
2006
A wafer-level packaging strategy for micro device chips based on uniquely orienting self-assembly is presented with the following… 
2006
2006
Note: MPI-I-2006-2-1 (Max-Planck Institute for Computer Science) Reference LARA-REPORT-2006-002 URL: http://arxiv.org/abs/cs.PL… 
2003
2003
Bleed-fast, dyed cellulosics particularly absorbent papers have been obtained with a particular class of water-soluble, cationic… 
Review
2002
Review
2002
SPASS is an automated theorem prover for full first-order logic with equality. This system description provides an overview of… 
1999
1999
We present a methodology for coupling several saturation-based theoremprovers (running on different computers). The methodology… 
Highly Cited
1996
Highly Cited
1996
System Description FLOTTER 1 and SPASS 2 are a clause normal form translator for rst-order logic and a theorem prover for rst…