SPASS+T

Prevosto, Virgile; Waldmann, Uwe

アイテム詳細

登録内容を編集ファイル形式で保存

一時保存へ追加

タグ情報を表示リリース履歴を表示詳細要約

公開

会議論文

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
(全文テキスト（全般）)

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

フルテキスト (公開)

公開されているフルテキストはありません

付随資料 (公開)

There is no public supplementary material available

引用

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.

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

要旨

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.