Who finds the short proof? : Searching for Wormholes in Proof-Space
Benzmüller, Christoph (2025): Who finds the short proof? : Searching for Wormholes in Proof-Space, in: Bamberg: Otto-Friedrich-Universität, S. 6.
Details
- Fakultät/Lehrstuhl
- Autorin(nen)/Autor(en)
- Verlagsangabe
- Otto-Friedrich-Universität : Bamberg
- Erscheinungsjahr
- 2025
- Quelle/Weitere Ausgabe
- Dagstuhl Reports : Dokumentationen zu Dagstuhl-Seminaren und Dagstuhl-Perspektiven-Workshops, Wadern: Schloss Dagstuhl, 2024, Jg. 13, Nr. 10, S. 6, ISSN: 2192-5283
- Jahr der Erstpublikation
- 2024
- Sprache(n)
- Englisch
- Lizenz
- URN
- Abstract
In my talk I presented recently published results that had not been communicated at conferences or workshops before: An exploration of Boolos’ Curious Inference using higher-order automated theorem provers (ATPs). Surprisingly, only suitable shorthand notations had to be provided by hand for ATPs to find a short proof. The higher-order lemmas required for constructing a short proof are automatically discovered by the ATPs. Given the observations and suggestions in this paper, full proof automation of Boolos’ and related examples now seems to be within reach of higher-order ATPs
- GND-Schlagwort(e)
- Automatisches Beweisverfahren
- Freie Schlagwort(e)
- short proof
- DDC-Klassifikation
- 004 Computer science
- RVK-Klassifikation
- ST 136
- Dokumenttyp
- Artikel in einer Zeitschrift / Postprint
- URI
- Datum der Freischaltung
- 30.05.2025