A Framework of Refutational Theorem Proving for Saturation−Based Decision Procedures
Automated state-of-the-art theorem provers are typically optimised for particular strategies, and there are only limited number of options that can be set by the user. Probably because of this, the general conditions on applicability of saturation-based calculi have not been thoroughly investigated....
第一著者: | Kazakov, Y |
---|---|
フォーマット: | Record |
出版事項: |
Max−Planck−Institut für Informatik
2005
|
類似資料
-
Proving, Refuting, Improving—Looking for a Theorem
著者:: Branislav Boričić
出版事項: (2022-10-01) -
Saturation−Based Decision Procedures for Extensions of the Guarded Fragment
著者:: Kazakov, Y
出版事項: (2006) -
The Reliability and the Purpos- Refutation Arguments in Proving Prophets' Infallibility: A Critical Survey
著者:: Hossein Atrak
出版事項: (2020-04-01) -
A Synthesis of the Procedural and Declarative Styles of Interactive Theorem Proving
著者:: Freek Wiedijk
出版事項: (2012-03-01) -
Theorem proving [filem]
出版事項: (1969)