资源分类
》 资源 》论文》Automated Theorem Proving for General Game Playing

Automated Theorem Proving for General Game Playing

2019-11-15 | |  73 |   41 |   0

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-specifific 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 offthe-shelf Answer Set Programming system in combination with a successful general game player.

上一篇：Composition of ConGolog Programs

下一篇：Effective Query Rewriting with Ontologies over DBoxes

用户评价
全部评价

热门资源

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • The Variational S...

    Unlike traditional images which do not offer in...

  • Learning to learn...

    The move from hand-designed features to learned...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...