DeepAI AI Chat
Log In Sign Up

On Exams with the Isabelle Proof Assistant

by   Frederik Krogsdal Jacobsen, et al.

We present an approach for testing student learning outcomes in a course on automated reasoning using the Isabelle proof assistant. The approach allows us to test both general understanding of formal proofs in various logical proof systems and understanding of proofs in the higher-order logic of Isabelle/HOL in particular. The use of Isabelle enables almost automatic grading of large parts of the exam. We explain our approach through a number of example problems, and explain why we believe that each of the kinds of problems we have selected are adequate measures of our intended learning outcomes. Finally, we discuss our experiences using the approach for the exam of a course on automated reasoning and suggest potential future work.


page 1

page 2

page 3

page 4


Working with first-order proofs and provers

Verifying software correctness has always been an important and complica...

Extensional Higher-Order Paramodulation in Leo-III

Leo-III is an automated theorem prover for extensional type theory with ...

A Mobile Application for Self-Guided Study of Formal Reasoning

In this work, we introduce AXolotl, a self-study aid designed to guide s...

Learning from Łukasiewicz and Meredith: Investigations into Proof Structures (Extended Version)

The material presented in this paper contributes to establishing a basis...

Investigations into Proof Structures

We introduce and elaborate a novel formalism for the manipulation and an...

Irrationality and Transcendence Criteria for Infinite Series in Isabelle/HOL

We give an overview of our formalizations in the proof assistant Isabell...

Überprüfung von Integritätsbedingungen in Deduktiven Datenbanken

Advancements in computer science and AI lead to the development of large...