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