Proof simplification and automated theorem proving
2019 ◽
Vol 377
(2140)
◽
pp. 20180034
◽
Keyword(s):
The proofs first generated by automated theorem provers are far from optimal by any measure of simplicity. In this paper, I describe a technique for simplifying automated proofs. Hopefully, this discussion will stimulate interest in the larger, still open, question of what reasonable measures of proof simplicity might be. This article is part of the theme issue ‘The notion of ‘simple proof’ - Hilbert's 24th problem’.
1999 ◽
Vol 13
(02)
◽
pp. 219-245
◽
2020 ◽
Vol 34
(10)
◽
pp. 13919-13920
2018 ◽
Keyword(s):