English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Conference Paper

SPASS Version 2.0

MPS-Authors
/persons/resource/persons45719

Weidenbach,  Christoph       
Automation of Logic, MPI for Informatics, Max Planck Society;
Programming Logics, MPI for Informatics, Max Planck Society;

/persons/resource/persons44171

Brahm,  Uwe
Information Services and Technology, MPI for Informatics, Max Planck Society;

/persons/resource/persons44621

Hillenbrand,  Thomas
International Max Planck Research School, MPI for Informatics, Max Planck Society;
Automation of Logic, MPI for Informatics, Max Planck Society;
Programming Logics, MPI for Informatics, Max Planck Society;

/persons/resource/persons44751

Keen,  Enno
Programming Logics, MPI for Informatics, Max Planck Society;

/persons/resource/persons45610

Theobalt,  Christian       
Computer Graphics, MPI for Informatics, Max Planck Society;
Programming Logics, MPI for Informatics, Max Planck Society;

Topić,  Dalibor
Max Planck Society;

/persons/resource/persons45678

Voronkov,  Andrei
Programming Logics, MPI for Informatics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

Weidenbach, C., Brahm, U., Hillenbrand, T., Keen, E., Theobalt, C., & Topić, D. (2002). SPASS Version 2.0. In Automated deduction, CADE-18: 18th International Conference on Automated Deduction (pp. 275-279). Heidelberg, Germany: Springer.


Cite as: https://hdl.handle.net/11858/00-001M-0000-000F-3084-C
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.