# Providing Hints, Next Steps and Feedback in a Tutoring System for Structural Induction

Structural induction is a proof technique that is widely used to prove statements about discrete structures. Students find it hard to construct inductive proofs, and when learning to construct such proofs, receiving feedback is important. In this paper we discuss the design of a tutoring system, LogInd, that helps students with constructing stepwise inductive proofs by providing hints, next steps and feedback. As far as we know, this is the first tutoring system for structural induction with this functionality. We explain how we use a strategy to construct proofs for a restricted class of problems. This strategy can also be used to complete partial student solutions, and hence to provide hints or next steps. We use constraints to provide feedback. A pilot evaluation with a small group of students shows that LogInd indeed can give hints and next steps in almost all cases.

## Authors

• 1 publication
• 2 publications
• 2 publications
• ### Proof of the impossibility of probabilistic induction

In this short note I restate and simplify the proof of the impossibility...
07/01/2021 ∙ by Vaden Masrani, et al. ∙ 0

• ### Learning how to Prove: From the Coq Proof Assistant to Textbook Style

We have developed an alternative approach to teaching computer science s...
03/05/2018 ∙ by Sebastian Böhne, et al. ∙ 0

• ### Proof Blocks: Autogradable Scaffolding Activities for Learning to Write Proofs

Proof Blocks is a software tool which enables students to write proofs b...
06/07/2021 ∙ by Seth Poulsen, et al. ∙ 0

• ### Smart Induction for Isabelle/HOL (System Description)

Proof assistants offer tactics to facilitate inductive proofs. However, ...
01/27/2020 ∙ by Yutaka Nagashima, et al. ∙ 0

• ### Induction Models on ℕ

Mathematical induction is a fundamental tool in computer science and mat...
08/14/2020 ∙ by A. Dileep, et al. ∙ 0

• ### Synthesizing Lemmas for Inductive Reasoning

Recursively defined structures and properties about them are naturally e...
09/21/2020 ∙ by Adithya Murali, et al. ∙ 0

• ### Memoryless Determinacy of Infinite Parity Games: Another Simple Proof

The memoryless determinacy of infinite parity games was proven independe...
03/01/2018 ∙ by Stephane Le Roux, et al. ∙ 0

##### This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.