System Description: SPASS Version 3.0
暂无分享,去创建一个
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.0, including support for dynamic modal logics, relational logics and expressive description logics, additional renaming and selection strategies, and significant interface enhancements for human and machine users.
[1] Christoph Weidenbach,et al. Computing Small Clause Normal Forms , 2001, Handbook of Automated Reasoning.
[2] Ullrich Hustadt,et al. MSPASS: Modal Reasoning by Translation and First-Order Resolution , 2000, TABLEAUX.
[3] U. Hustadt,et al. A Survey of Decidable First-Order Fragments and Description Logics , 2004 .
[4] Christoph Weidenbach,et al. SPASS version 2.0 , 2002 .
[5] Christoph Weidenbach,et al. MSPASS: Subsumption Testing with SPASS , 1999, Description Logics.