Graph Representations for Higher-Order Logic and Theorem Proving (2019)

Re:Graph Representations for Higher-Order Logic and Theorem ... by riku_iki on Sunday September 06, 2020 @10:55AM (#24391746)

I think they can use transformer in the same way for proof path generation: do pattern matching for complex logical statements to find those where specific rule can be applied, similarly as it has be done in differential equations paper.

[ Parent | on HN ]

Re:Graph Representations for Higher-Order Logic and Theorem ... by Tainnor on Monday September 07, 2020 @03:57PM (#24402240)

How does that help and/or address any of what I wrote?

You can generate possible transformations from one proposition to another one, yes. But the space of possible transformations is infinite, how does the system know which ones to try? Moreover, even if you try some local transformation, how do you know that you have made progress?

A system like that could probably perform well on typical undergraduate proofs: epsilon-delta, proof that such and such a thing is a norm, etc., but it's gonna have a hard time with more difficult problems.

[ Parent | on HN ]