Cognitive Complexity of Logical Reasoning in Games: Automated Theorem Proving Perspective

Research output: Contribution to conferenceConference abstract for conferenceResearchpeer-review

101 Downloads (Pure)

Abstract

We use formal proof techniques from artificial intelligence and mathematical logic to analyse human reasoning in problem solving. We focus on the Deductive Mastermind game, as implemented in the Dutch massive online learning system for children, Math Garden. The game is formalised in propositional logic and the game-playing procedure is given a form of a logical proof. We use Resolution and Natural Deduction proof methods (implemented in JAVA). The difficulty of a particular logical reasoning step is associated with the computationally obtained parameters of the proofs, which are compared with each other, and against the empirical difficulty of the game. We show, among others, that the complexity parameters derived from Natural Deduction agree with the Analytical Tableaux parameters, and with the empirical difficulty as experienced by human subjects.
Original languageEnglish
Publication date2019
Publication statusPublished - 2019
Event41st Annual Meeting of the Cognitive Science Society - Palais des Congrès de Montréal, Montreal, Canada
Duration: 24 Jul 201927 Jul 2019
Conference number: 41

Conference

Conference41st Annual Meeting of the Cognitive Science Society
Number41
LocationPalais des Congrès de Montréal
Country/TerritoryCanada
CityMontreal
Period24/07/201927/07/2019

Fingerprint

Dive into the research topics of 'Cognitive Complexity of Logical Reasoning in Games: Automated Theorem Proving Perspective'. Together they form a unique fingerprint.

Cite this