Statusvortrag im Promotionsverfahren: "Automated Theorem Proving for General Game Playing"

Datum

18.05.2011

Zeit

11:00 - 12:00

Sprecher

Sebastian Haufe

Zugehörigkeit

TU Dresden

Sprache

en

Hauptthema

Informatik

Andere Themen

Informatik

Beschreibung

While Game Playing Systems like Deep Blue perform excellent within their domain, handling a different game or even a slight change of rules is impossible without intervention of the programmer. Considered a great challenge for Artificial Intelligence, General Game Playing is concerned with the development of techniques that enable computer programs to play arbitrary, possibly unknown n-player games given nothing but the game rules in a taylor-made description language. In this setting, a general game player greatly benefits from the ability to automatically gain knowledge about hidden key features of the game. This talk first compares two existing approaches to reliably prove game properties. While the one allows to specify diverse properties but is applicable to very small games only, the other succeeds in verifying the subclass of state invariants efficiently for a variety of games. The talk subsequently presents thesis work on a substantial extension of the latter approach to efficiently include an interesting class of temporal properties. It further sketches how to incorporate agent knowledge into the framework, accounting for the recent extension of the game description language to incomplete-information games.

Letztmalig verändert: 18.05.2011, 09:35:32