4 citations · 4 across the 3 of their papers we have counts for
Showing cs.LGShow all
2 papers · 1 filter
cs.LG2021
Neural Termination Analysis
Mirco Giacobbe, Daniel Kroening, Julian Parsert
We introduce a novel approach to the automated termination analysis of computer programs: we use neural networks to represent ranking functions. Ranking functions map program state…
cs.LG2021★ 4 cited
A Study of Continuous Vector Representationsfor Theorem Proving
Stanisław Purgał, Julian Parsert, Cezary Kaliszyk
Applying machine learning to mathematical terms and formulas requires a suitable representation of formulas that is adequate for AI methods. In this paper, we develop an encoding t…