{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/121414"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/121414","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"Proof blocks: autogradable scaffolding activities for learning to write proofs","abstract":"Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2023-12-04 without embargo terms","abstract_html":"Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2023-12-04 without embargo terms","abstract_has_math":false,"creators":["Poulsen, Seth"],"institution":"University of Illinois at Urbana-Champaign","degree_name":"Ph.D.","degree_level":"Dissertation","degree_discipline":"Computer Science","degree_department":null,"school":null,"contributors":["Herman, Geoffrey L","West, Matthew","Zilles, Craig","Viswanathan, Mahesh","Koedinger, Kenneth"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2023,"date_issued":"2023-08","date_published":"2023-08","updated_at":"2026-07-22T22:24:57Z","subjects":["Educational Software Mathematical Proofs Graph Algorithms"],"languages":["en","eng"],"rights":["Copyright 2023 Seth Poulsen"],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"https://hdl.handle.net/2142/121414","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Herman, Geoffrey L","West, Matthew","Zilles, Craig","Viswanathan, Mahesh","Koedinger, Kenneth"]},{"key":"dc:creator","label":"Author","values":["Poulsen, Seth"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2023-08","2023-07-06"]},{"key":"dc:type","label":"Dc Type","values":["text"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Computer Science"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Dissertation"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Ph.D."]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of Illinois at Urbana-Champaign"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Educational Software Mathematical Proofs Graph Algorithms"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["en","eng"]},{"key":"dc:rights","label":"Dc Rights","values":["Copyright 2023 Seth Poulsen"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://hdl.handle.net/2142/121414"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2023-12-04 without embargo terms","The student, Seth Poulsen, accepted the attached license on 2023-06-09 at 11:54.","The student, Seth Poulsen, submitted this Dissertation for approval on 2023-07-03 at 15:59.","This Dissertation was approved for publication on 2023-07-06 at 09:55.","DSpace SAF Submission Ingestion Package generated from Vireo submission #19413 on 2023-12-04 at 16:59:55","This dissertation introduces \\tool, a tool which enables students to construct mathematical proofs by dragging and dropping prewritten proof lines into the correct order instead of needing to write them from scratch. First we present implementation details of the tool, as well as a rich reflection on our experiences using the tool in courses with hundreds of students. When writing a problem, the instructor specifies the dependency graph of the lines of the proof, so that any correct arrangement of the lines can receive full credit. We develop a novel algorithm which enables assigning students' partial credit on \\tool{} problems based on the number of edits that their submission is from a correct solution, and give benchmarking results showing that this performance gives significant performance gains over the baseline algorithm, enabling large scale classroom deployment. Finally, we will present evaluations of \\tool{} both in learning and assessment contexts. For assessment, we provide statistical evidence that \\tool{} are easier than written proofs, which are typically very difficult. We also show that \\tool{} problems provide about as much information about student knowledge as written proofs. Survey results show that students believe that the Proof Blocks user interface is easy to use, and that the questions accurately represent their ability to write proofs. Through our experiments targeted at measuring student learning, we provide evidence about various aspects of the process of students learning proof by induction. We give evidence that using Proof Blocks alone is not as effective for learning as using Proof Blocks after reading educational materials first. We also show that students who read a book chapter and complete a Proof Blocks activity perform marginally better than students who only read the book chapter, but it is not clear if the source of this improvement is the Proof Blocks or just exposure to more examples. Together with the evidence from out study showing that students who write proofs from scratch also learn no more than students just reading the book chapter, we conclude that though students can have clear learning gains very quickly when they have low knowledge of proof by induction, subsequent incremental learning gains are very difficult, and it is not well understood how to design a learning activity to help students experience these learning gains in a short period of time."]},{"key":"dc:format","label":"Dc Format","values":["application/pdf"]},{"key":"dc:title","label":"Title","values":["Proof blocks: autogradable scaffolding activities for learning to write proofs"]}]}],"canonical_facts":{"dc:contributor":["Herman, Geoffrey L","West, Matthew","Zilles, Craig","Viswanathan, Mahesh","Koedinger, Kenneth"],"dc:creator":["Poulsen, Seth"],"dc:date":["2023-08","2023-07-06"],"dc:description":["Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2023-12-04 without embargo terms","The student, Seth Poulsen, accepted the attached license on 2023-06-09 at 11:54.","The student, Seth Poulsen, submitted this Dissertation for approval on 2023-07-03 at 15:59.","This Dissertation was approved for publication on 2023-07-06 at 09:55.","DSpace SAF Submission Ingestion Package generated from Vireo submission #19413 on 2023-12-04 at 16:59:55","This dissertation introduces \\tool, a tool which enables students to construct mathematical proofs by dragging and dropping prewritten proof lines into the correct order instead of needing to write them from scratch. First we present implementation details of the tool, as well as a rich reflection on our experiences using the tool in courses with hundreds of students. When writing a problem, the instructor specifies the dependency graph of the lines of the proof, so that any correct arrangement of the lines can receive full credit. We develop a novel algorithm which enables assigning students' partial credit on \\tool{} problems based on the number of edits that their submission is from a correct solution, and give benchmarking results showing that this performance gives significant performance gains over the baseline algorithm, enabling large scale classroom deployment. Finally, we will present evaluations of \\tool{} both in learning and assessment contexts. For assessment, we provide statistical evidence that \\tool{} are easier than written proofs, which are typically very difficult. We also show that \\tool{} problems provide about as much information about student knowledge as written proofs. Survey results show that students believe that the Proof Blocks user interface is easy to use, and that the questions accurately represent their ability to write proofs. Through our experiments targeted at measuring student learning, we provide evidence about various aspects of the process of students learning proof by induction. We give evidence that using Proof Blocks alone is not as effective for learning as using Proof Blocks after reading educational materials first. We also show that students who read a book chapter and complete a Proof Blocks activity perform marginally better than students who only read the book chapter, but it is not clear if the source of this improvement is the Proof Blocks or just exposure to more examples. Together with the evidence from out study showing that students who write proofs from scratch also learn no more than students just reading the book chapter, we conclude that though students can have clear learning gains very quickly when they have low knowledge of proof by induction, subsequent incremental learning gains are very difficult, and it is not well understood how to design a learning activity to help students experience these learning gains in a short period of time."],"dc:format":["application/pdf"],"dc:identifier":["https://hdl.handle.net/2142/121414"],"dc:language":["en","eng"],"dc:rights":["Copyright 2023 Seth Poulsen"],"dc:subject":["Educational Software Mathematical Proofs Graph Algorithms"],"dc:title":["Proof blocks: autogradable scaffolding activities for learning to write proofs"],"dc:type":["text"],"thesis:degree_discipline":["Computer Science"],"thesis:degree_level":["Dissertation"],"thesis:degree_name":["Ph.D."],"thesis:institution_name":["University of Illinois at Urbana-Champaign"]},"updated_at":"2026-07-22T22:24:57Z"}