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)