Automated theorem proving for General Game Playing

Stephan Schiffel, Michael Thielscher

    Research output: Chapter in Book / Conference PaperConference Paperpeer-review

    22 Citations (Scopus)

    Abstract

    ![CDATA[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.]]
    Original languageEnglish
    Title of host publicationIJCAI-09: Proceedings of the Tweny-first International Joint Conference on Artificial Intelligence, Pasadena, California, USA, 11-17 July 2009
    PublisherAAAI Press
    Pages911-916
    Number of pages6
    ISBN (Print)9781577354260
    Publication statusPublished - 2009
    EventInternational Joint Conference on Artificial Intelligence -
    Duration: 3 Aug 2013 → …

    Publication series

    Name
    ISSN (Print)1045-0823

    Conference

    ConferenceInternational Joint Conference on Artificial Intelligence
    Period3/08/13 → …

    Fingerprint

    Dive into the research topics of 'Automated theorem proving for General Game Playing'. Together they form a unique fingerprint.

    Cite this