Efficient Feedback and Partial Credit Grading for Proof Blocks Problems

被引:4
|
作者
Poulsen, Seth [1 ]
Kulkarni, Shubhang [1 ]
Herman, Geoffrey [1 ]
West, Matthew [1 ]
机构
[1] Univ Illinois, Urbana, IL 61801 USA
关键词
Mathematical proofs; Automated feedback; Scaffolding;
D O I
10.1007/978-3-031-36272-9_41
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Proof Blocks is a software tool that allows students to practice writing mathematical proofs by dragging and dropping lines instead of writing proofs from scratch. Proof Blocks offers the capability of assigning partial credit and providing solution quality feedback to students. This is done by computing the edit distance from a student's submission to some predefined set of solutions. In this work, we propose an algorithm for the edit distance problem that significantly outperforms the baseline procedure of exhaustively enumerating over the entire search space. Our algorithm relies on a reduction to the minimum vertex cover problem. We benchmark our algorithm on thousands of student submissions from multiple courses, showing that the baseline algorithm is intractable, and that our proposed algorithm is critical to enable classroom deployment. Our new algorithm has also been used for problems in many other domains where the solution space can be modeled as a DAG, including but not limited to Parsons Problems for writing code, helping students understand packet ordering in networking protocols, and helping students sketch solution steps for physics problems. Integrated into multiple learning management systems, the algorithm serves thousands of students each year.
引用
收藏
页码:502 / 514
页数:13
相关论文
共 50 条
  • [1] Benchmarking Partial Credit Grading Algorithms for Proof Blocks Problems
    Poulsen, Seth
    Kulkarni, Shubhang
    Herman, Geoffrey
    West, Matthew
    ARTIFICIAL INTELLIGENCE IN EDUCATION: POSTERS AND LATE BREAKING RESULTS, WORKSHOPS AND TUTORIALS, INDUSTRY AND INNOVATION TRACKS, PRACTITIONERS AND DOCTORAL CONSORTIUM, PT II, 2022, 13356 : 199 - 203
  • [2] Evaluating proof blocks problems as exam questions
    Poulsen S.
    Viswanathan M.
    Herman G.L.
    West M.
    ACM Inroads, 2022, 13 (01) : 41 - 51
  • [3] Evaluating Proof Blocks Problems as Exam Questions
    Poulsen, Seth
    Viswanathan, Mahesh
    Herman, Geoffrey L.
    West, Matthew
    ICER 2021: PROCEEDINGS OF THE 17TH ACM CONFERENCE ON INTERNATIONAL COMPUTING EDUCATION RESEARCH, 2021, : 157 - 168
  • [4] Partial Credit Grading of DFAs: Automation vs Human Graders
    Smearsoll, Nathan
    Bezakova, Ivona
    PROCEEDINGS OF THE 54TH ACM TECHNICAL SYMPOSIUM ON COMPUTER SCIENCE EDUCATION, VOL 2, SIGCSE 2023, 2023, : 1383 - 1383
  • [5] Partial proof trees as building blocks for a categorial grammar
    Joshi, AK
    Kulick, S
    LINGUISTICS AND PHILOSOPHY, 1997, 20 (06) : 637 - 667
  • [6] Partial Proof Trees as Building Blocks for a Categorial Grammar
    Aravind K. Joshi
    Seth Kulick
    Linguistics and Philosophy, 1997, 20 : 637 - 667
  • [8] Strategy-Proof and Efficient Kidney Exchange Using a Credit Mechanism
    Hajaj, Chen
    Dickerson, John P.
    Hassidim, Avinatan
    Sandholm, Tuomas
    Sarne, David
    PROCEEDINGS OF THE TWENTY-NINTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2015, : 921 - 928
  • [9] Generating a growth-oriented partial credit grading model for the Force Concept Inventory
    Eaton, Philip
    Johnson, Keith
    Willoughby, Shannon
    PHYSICAL REVIEW PHYSICS EDUCATION RESEARCH, 2019, 15 (02):
  • [10] An efficient Genetic Algorithm for the Feedback Set Problems
    Noughabi, Havva Alizadeh
    Baghbani, Farzaneh Ghayour
    2014 IRANIAN CONFERENCE ON INTELLIGENT SYSTEMS (ICIS), 2014,