A Temporal Proof System for General Game Playing

被引:0
作者
Thielscher, Michael [1 ]
Voigt, Sebastian [2 ]
机构
[1] Univ New South Wales, Sch Comp Sci & Engn, Kensington, NSW, Australia
[2] Tech Univ Dresden, Dept Comp Sci, Dresden, Germany
来源
PROCEEDINGS OF THE TWENTY-FOURTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE (AAAI-10) | 2010年
关键词
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
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.
引用
收藏
页码:1000 / 1005
页数:6
相关论文
共 16 条
  • [1] [Anonymous], 2008, General game playing: Game description language specification
  • [2] [Anonymous], 2007, Proceedings of the 22nd National Conference on Artificial Intelligence (AAAI'07)
  • [3] [Anonymous], 2007, Proceedings of the AAAI National Conference on Artificial Intelligence
  • [4] Apt K., 1987, F DEDUCTIVE DATABASE, P89
  • [5] Using temporal logics to express search control knowledge for planning
    Bacchus, F
    Kabanza, F
    [J]. ARTIFICIAL INTELLIGENCE, 2000, 116 (1-2) : 123 - 191
  • [6] CADIAPLAYER: A Simulation-Based General Game Player
    Bjornsson, Yngvi
    Finnsson, Hilmar
    [J]. IEEE TRANSACTIONS ON COMPUTATIONAL INTELLIGENCE AND AI IN GAMES, 2009, 1 (01) : 4 - 15
  • [7] Gelfond M, 2008, FOUND ARTIF INTELL, P285, DOI 10.1016/S1574-6526(07)03007-6
  • [8] Genesereth M, 2005, AI MAG, V26, P62
  • [9] Kuhlmann G., 2006, AAAI'06, P1457
  • [10] A BASIS FOR DEDUCTIVE DATABASE-SYSTEMS .2.
    LLOYD, JW
    TOPOR, RW
    [J]. JOURNAL OF LOGIC PROGRAMMING, 1986, 3 (01): : 55 - 67