A temporal proof system for General Game Playing

Michael Thielscher; Sebastian Voigt

A temporal proof system for General Game Playing

Michael Thielscher, Sebastian Voigt

Research output: Chapter in Book / Conference Paper › Conference Paper › peer-review

Abstract

![CDATA[A general game player is a system that understands the rules of unknown games and learns to play these games well without human intervention. A major challenge for research in General Game Playing is to endow a player with the ability to extract and prove game-specific knowledge from the mere game rules. We define a formal language to express temporally extended - yet local - properties of games. We also develop a provably correct proof theory for this language using the paradigm of Answer Set Programming, and we report on experiments with a practical implementation of this proof system in combination with a successful general game player.]]

Original language	English
Title of host publication	Proceedings of the Twenty-fourth AAAI Conference on Artificial Intelligence and the Twenty-second Innovative Applications of Artificial Intelligence Conference, 11-15 July, 2010, Atlanta, Georgia, USA
Publisher	AAAI Press
Pages	1000-1005
Number of pages	6
ISBN (Print)	9781577354659
Publication status	Published - 2010
Event	AAAI Conference on Artificial Intelligence - Duration: 22 Jul 2012 → …

Conference

Conference	AAAI Conference on Artificial Intelligence
Period	22/07/12 → …

Cite this

@inproceedings{2cd69e05631d484dbab2bfe274c1cba1,

title = "A temporal proof system for General Game Playing",

abstract = "![CDATA[A general game player is a system that understands the rules of unknown games and learns to play these games well without human intervention. A major challenge for research in General Game Playing is to endow a player with the ability to extract and prove game-specific knowledge from the mere game rules. We define a formal language to express temporally extended - yet local - properties of games. We also develop a provably correct proof theory for this language using the paradigm of Answer Set Programming, and we report on experiments with a practical implementation of this proof system in combination with a successful general game player.]]",

author = "Michael Thielscher and Sebastian Voigt",

year = "2010",

language = "English",

isbn = "9781577354659",

pages = "1000--1005",

booktitle = "Proceedings of the Twenty-fourth AAAI Conference on Artificial Intelligence and the Twenty-second Innovative Applications of Artificial Intelligence Conference, 11-15 July, 2010, Atlanta, Georgia, USA",

publisher = "AAAI Press",

note = "AAAI Conference on Artificial Intelligence ; Conference date: 22-07-2012",

}

A temporal proof system for General Game Playing. / Thielscher, Michael; Voigt, Sebastian.
Proceedings of the Twenty-fourth AAAI Conference on Artificial Intelligence and the Twenty-second Innovative Applications of Artificial Intelligence Conference, 11-15 July, 2010, Atlanta, Georgia, USA. AAAI Press, 2010. p. 1000-1005.

Research output: Chapter in Book / Conference Paper › Conference Paper › peer-review

TY - GEN

T1 - A temporal proof system for General Game Playing

AU - Thielscher, Michael

AU - Voigt, Sebastian

PY - 2010

Y1 - 2010

N2 - ![CDATA[A general game player is a system that understands the rules of unknown games and learns to play these games well without human intervention. A major challenge for research in General Game Playing is to endow a player with the ability to extract and prove game-specific knowledge from the mere game rules. We define a formal language to express temporally extended - yet local - properties of games. We also develop a provably correct proof theory for this language using the paradigm of Answer Set Programming, and we report on experiments with a practical implementation of this proof system in combination with a successful general game player.]]

AB - ![CDATA[A general game player is a system that understands the rules of unknown games and learns to play these games well without human intervention. A major challenge for research in General Game Playing is to endow a player with the ability to extract and prove game-specific knowledge from the mere game rules. We define a formal language to express temporally extended - yet local - properties of games. We also develop a provably correct proof theory for this language using the paradigm of Answer Set Programming, and we report on experiments with a practical implementation of this proof system in combination with a successful general game player.]]

UR - http://handle.uws.edu.au:8081/1959.7/550020

UR - http://www.aaai.org/Conferences/IAAI/iaai10.php

M3 - Conference Paper

SN - 9781577354659

SP - 1000

EP - 1005

BT - Proceedings of the Twenty-fourth AAAI Conference on Artificial Intelligence and the Twenty-second Innovative Applications of Artificial Intelligence Conference, 11-15 July, 2010, Atlanta, Georgia, USA

PB - AAAI Press

T2 - AAAI Conference on Artificial Intelligence

Y2 - 22 July 2012

ER -

A temporal proof system for General Game Playing

Abstract

Conference

Other files and links

Fingerprint

Cite this