Using Automated Theorem Provers to Teach Knowledge Representation in First-Order Logic
Angelo Kyrilov, David Noelle

TL;DR
This paper presents an automated grading system using a theorem prover to help undergraduate AI students learn first-order logic knowledge representation more effectively, with significant improvements in exam performance.
Contribution
It introduces a novel automated assessment system employing a resolution theorem prover for first-order logic exercises in AI education, enhancing student learning outcomes.
Findings
Significant improvement in student exam scores.
Effective automated feedback for logic exercises.
Potential for richer formative feedback methods.
Abstract
Undergraduate students of artificial intelligence often struggle with representing knowledge as logical sentences. This is a skill that seems to require extensive practice to obtain, suggesting a teaching strategy that involves the assignment of numerous exercises involving the formulation of some bit of knowledge, communicated using a natural language such as English, as a sentence in some logic. The number of such exercises needed to master this skill is far too large to allow typical artificial intelligence course teaching teams to provide prompt feedback on student efforts. Thus, an automated assessment system for such exercises is needed to ensure that students receive an adequate amount of practice, with the rapid delivery of feedback allowing students to identify errors in their understanding and correct them. This paper describes an automated grading system for knowledge…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLogic, programming, and type systems · Intelligent Tutoring Systems and Adaptive Learning · Logic, Reasoning, and Knowledge
