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....
Autor principal: | Kazakov, Y |
---|---|
Format: | Record |
Publicat: |
Max−Planck−Institut für Informatik
2005
|
Ítems similars
-
Proving, Refuting, Improving—Looking for a Theorem
per: Branislav Boričić
Publicat: (2022-10-01) -
Saturation−Based Decision Procedures for Extensions of the Guarded Fragment
per: Kazakov, Y
Publicat: (2006) -
The Reliability and the Purpos- Refutation Arguments in Proving Prophets' Infallibility: A Critical Survey
per: Hossein Atrak
Publicat: (2020-04-01) -
A Synthesis of the Procedural and Declarative Styles of Interactive Theorem Proving
per: Freek Wiedijk
Publicat: (2012-03-01) -
Theorem proving [filem]
Publicat: (1969)