pith. sign in

arxiv: 0903.0314 · v4 · submitted 2009-03-02 · 💻 cs.AI

Granularity-Adaptive Proof Presentation

classification 💻 cs.AI
keywords proofgranularitypresentationproofsautomatedlevelmodeltechniques
0
0 comments X
read the original abstract

When mathematicians present proofs they usually adapt their explanations to their didactic goals and to the (assumed) knowledge of their addressees. Modern automated theorem provers, in contrast, present proofs usually at a fixed level of detail (also called granularity). Often these presentations are neither intended nor suitable for human use. A challenge therefore is to develop user- and goal-adaptive proof presentation techniques that obey common mathematical practice. We present a flexible and adaptive approach to proof presentation that exploits machine learning techniques to extract a model of the specific granularity of proof examples and employs this model for the automated generation of further proofs at an adapted level of granularity.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.