SPASS+T

Prevosto, Virgile; Waldmann, Uwe

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Conference Paper

SPASS+T

MPS-Authors

/persons/resource/persons45689

Waldmann, Uwe
Automation of Logic, MPI for Informatics, Max Planck Society;

External Resource

http://ceur-ws.org/Vol-192/paper02.pdf
(Any fulltext)

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

Prevosto, V., & Waldmann, U. (2006). SPASS+T. In G. Sutcliffe, R. Schmidt, & S. Schulz (Eds.), Proceedings of the FLoC'06 Workshop on Empirically Successful Computerized Reasoning (pp. 18-33). Aachen: CEUR-WS.org. Retrieved from http://CEUR-WS.org/Vol-192/paper02.pdf.

Cite as: https://hdl.handle.net/11858/00-001M-0000-000F-24DF-7

Abstract

SPASS+T is an extension of the superposition-based theorem prover SPASS that allows us to enlarge the reasoning capabilities of SPASS using an arbitrary SMT procedure for arithmetic and free function symbols as a black-box. We discuss the architecture of SPASS+T and the capabilities, limitations, and applications of such a combination.