Clue as a Testbed for Automated Theorem Proving

Authors:
Eric Neufeld
Affiliations:
-
Venue:
AI '02 Proceedings of the 15th Conference of the Canadian Society for Computational Studies of Intelligence on Advances in Artificial Intelligence
Year:
2002

Citing 5
Cited 0

Depth-first iterative-deepening: an optimal admissible tree search

Artificial Intelligence
A logical framework for default reasoning

Artificial Intelligence
A Prolog technology theorem prover: implementation by an extended Prolog computer

Journal of Automated Reasoning
Clause trees: a tool for understanding and implementing resolution in automated reasoning

Artificial Intelligence
Knowledge and Planning in an Action-Based Multi-agent Framework: A Case Study

AI '01 Proceedings of the 14th Biennial Conference of the Canadian Society on Computational Studies of Intelligence: Advances in Artificial Intelligence

Quantified Score

Hi-index	0.01

Visualization

Abstract

Recent articles explore formalizations of the popular board game Clue. For several years, this game was used as a testbed for automated theorem proving exercises in the context of introductory and advanced AI classes at the University of Saskatchewan, by way of motivating the usefulness of Prolog Technology Theorem Provers (PTTPS) as game playing engines. Although the game has a simple axiomatization over a small universe, adapting a PTTP to play a full game of Clue is not trivial. This paper illustrates solutions to problems encountered during this exercise, including some interesting computational rules of inference.