The role of games in computing science has been given some consideration in the literature. We aim to design games that can be used for teaching logic. Specifically, we build on the Minefield game used in the Stanford Intro to Logic course, and present a version, which we call MineFOL, that incorporates time constraints. We also move beyond the Stanford examples in that we provide a formalisation of the game, with a view to eventually generating game instances automatically as well as from user input, and show how MineFOL can be used as a learning tool. We also developed an online platform supporting learners in at least three ways. First, the learners can practice reasoning in First Order Logic (FOL) and proving strategies such as resolution through various MineFOL games. Second, the learners can practice formalisation in FOL, by allowing learners to build their own games. Third, the learners become aware of the need of interleaving various technologies to solve a logicbased task. In this line, MineFOL is formalised in such way to allow augmenting reasoning in FOL with search strategies.
[1]
Dawn Xiaodong Song,et al.
GamePad: A Learning Environment for Theorem Proving
,
2018,
ICLR.
[2]
William McCune,et al.
Mace4 Reference Manual and Guide
,
2003,
ArXiv.
[3]
Luis von Ahn.
Games with a Purpose
,
2006,
Computer.
[4]
R. Verbrugge,et al.
Discourses on Social Software
,
2009
.
[5]
Roger Levy,et al.
Solving logic puzzles: From robust processing to precise semantics
,
2004,
Proceedings of the 2nd Workshop on Text Meaning and Interpretation - TextMean '04.
[6]
Zbigniew Michalewicz,et al.
Guide to Teaching Puzzle-based Learning
,
2014,
Undergraduate Topics in Computer Science.
[7]
Paulo Oliva,et al.
Studying Algebraic Structures using Prover9 and Mace4
,
2019,
ArXiv.