Automated Generation of User Guidance by Combining Computation and Deduction
Author:
- Walther NeuperWNWalther Neuper
Open Access
- 21 February 2012
- journal article
- Published by Open Publishing Association in Electronic Proceedings in Theoretical Computer Science
- Vol. 79, 82-101
Abstract
Herewith, a fairly old concept is published for the first time and named "Lucas Interpretation". This has been implemented in a prototype, which has been proved useful in educational practice and has gained academic relevance with an emerging generation of educational mathematics assistants (EMA) based on Computer Theorem Proving (CTP). Automated Theorem Proving (ATP), i.e. deduction, is the most reliable technology used to check user input. However ATP is inherently weak in automatically generating solutions for arbitrary problems in applied mathematics. This weakness is crucial for EMAs: when ATP checks user input as incorrect and the learner gets stuck then the system should be able to suggest possible next steps. The key idea of Lucas Interpretation is to compute the steps of a calculation following a program written in a novel CTP-based programming language, i.e. computation provides the next steps. User guidance is generated by combining deduction and computation: the latter is performed by a specific language interpreter, which works like a debugger and hands over control to the learner at breakpoints, i.e. tactics generating the steps of calculation. The interpreter also builds up logical contexts providing ATP with the data required for checking user input, thus combining computation and deduction. The paper describes the concepts underlying Lucas Interpretation so that open questions can adequately be addressed, and prerequisites for further work are provided.Comment: In Proceedings THedu'11, arXiv:1202.453Keywords
All Related Versions
This publication has 12 references indexed in Scilit:
- CTP-based programming languages?ACM Communications in Computer Algebra, 2010
- Automating Side Conditions in Formalized Partial Functions2008
- The Four Colour Theorem: Engineering of a Formal Proof2008
- Certified Computer Algebra on Top of an Interactive Theorem ProverLecture Notes in Computer Science, 2007
- Not seeing the roots for the branchesACM SIGSAM Bulletin, 2004
- Theorem Proving with the Real Numbers1998
- Refinement Calculus1998
- Teaching Math More Effectively, Through Calculational ProofsThe American Mathematical Monthly, 1995
- Predicate Calculus and Program Semantics1990
- On the formalization of programming languages: Early history and main approaches1978