Automated Theorem Proving for General Game Playing
Proceedings of the Twenty-First International Joint Conference on Artificial Intelligence. Pages 911-915.
Abstract
A general game player is a system that understands the rules of an unknown game and learns to play this game well without human intervention. To succeed in this endeavor, systems need to be able to extract and prove game-specific knowledge from the mere game rules. We present a practical approach to this challenge with the help of Answer Set Programming. The key idea is to reduce the automated theorem proving task to a simple proof of an induction step and its base case. We prove correctness of this method and report on experiments with an off-the-shelf Answer Set Programming system in combination with a successful general game player.Stephan Schiffel, Michael Thielscher
@inproceedings{ijcai2009p155,
title = {Automated Theorem Proving for General Game Playing},
author = {Schiffel, Stephan and Thielscher, Michael},
booktitle = {Proceedings of the Twenty-First International Joint Conference on
Artificial Intelligence, {IJCAI-09}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Hiroaki Kitano},
pages = {911--915},
year = {2009},
url = {https://ijcai.org/proceedings/2009/155},
}
TY - CPAPER TI - Automated Theorem Proving for General Game Playing AU - Schiffel, Stephan AU - Thielscher, Michael T2 - Proceedings of the Twenty-First International Joint Conference on Artificial Intelligence, IJCAI-09 PB - International Joint Conferences on Artificial Intelligence PY - 2009 SP - 911 EP - 915 UR - https://ijcai.org/proceedings/2009/155 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
