Filtering with logic programs and its application to general game playing
DOI:
关键词:
摘要: Motivated by the problem of building a basic reasoner for general game playing with imperfect information, we address filtering logic programs, whereby an agent updates its incomplete knowledge program observations. We develop method adapting existing backward-chaining and abduction so-called open programs. Experimental results show that this provides effective efficient "legal" player imperfect-information games.
unsw.edu.au 参考文章(23)
J. W. Lloyd, Foundations of logic programming; (2nd extended ed.) Springer-Verlag New York, Inc.. ,(1987)
Dana Nau, Austin Parker, V. S. Subrahmanian, Game-tree search with combinatorially large belief states international joint conference on artificial intelligence. pp. 254- 259 ,(2005)
Stefan Edelkamp, Tim Federholzner, Peter Kissmann, Searching with Partial Belief States in General Games with Incomplete Information Lecture Notes in Computer Science. pp. 25- 36 ,(2012) , 10.1007/978-3-642-33347-7_3
Michael Thielscher, The general game playing description language is universal international joint conference on artificial intelligence. pp. 1107- 1112 ,(2011) , 10.5591/978-1-57735-516-8/IJCAI11-189
Michael Thielscher, Timothy Cerexhe, Michael Schofield, HyperPlay: a solution to general game playing with imperfect information national conference on artificial intelligence. pp. 1606- 1612 ,(2012)
H. Rasiowa, Introduction to Metamathematics ,(1952)
P. A. Bonatti, Resolution for Skeptical Stable Model Semantics Journal of Automated Reasoning. ,vol. 27, pp. 391- 421 ,(2001) , 10.1023/A:1011960831261
Abdallah Saffidine, Tristan Cazenave, A Forward Chaining Based Game Description Language Compiler ,(2011)
John Wylie Lloyd, Foundations of logic programming ,(1984)
Michael Thielscher, A general game description language for incomplete information games national conference on artificial intelligence. pp. 994- 999 ,(2010)