Learning games from videos guided by descriptive complexity

Proceedings of the National Conference on Artificial Intelligence

Volumn 2, Issue , 2012, Pages 963-969

  Kaiser, Łukasz ^a  

^a UNIVERSITÉ PARIS DIDEROT   (France)

Author keywords

[No Author keywords available]

Indexed keywords

BACKGROUND KNOWLEDGE; BOARD GAMES; DESCRIPTIVE COMPLEXITY; LEARNING GAME; POSITION EVALUATION;

ARTIFICIAL INTELLIGENCE;

EID: 84868291496     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (26)

1. Antanas, L.-A.; Thon, I.; van Otterlo, M.; Landwehr, N.; and Raedt, L. D. 2009. Probabilistic logical sequence learning for video. In Preliminary Proc. of ILP'09.
2. Bailey, D. G.; Mercer, K. A.; and Plaw, C. 2004. Autonomous game playing robot. In Proc. of ICARA'04.
3. Barbu, A.; Narayanaswamy, S.; and Siskind, J. M. 2010. Learning physically-instantiated game play through visual observation. In Proc. of ICRA'10, 1879-1886.
4. Canny, J. 1986. A computational approach to edge detection. IEEE Trans. Pattern Anal. Mach. Intell. 8(6):679-698.
5. Duda, R. O., and Hart, P. E. 1972. Use of the Hough transformation to detect lines and curves in pictures. Communications of the ACM 15(1):11-15.
6. Etessami, K., and Immerman, N. 2000. Tree canonization and transitive closure. Inf. Comput. 157(1-2):2-24.
7. Fagin, R. 1974. Generalized first-order spectra and polynomial-time recognizable sets. In SIAM-AMS Proceedings, volume 7, 27-41.
8. Gaifman, H. 1982. On local and non-local properties. In Proc. of the Herbrand Symposium, Logic Colloquium'81, 105-135. North Holland.
9. Goodacre, J. 1996. Inductive learning of chess rules using Progol. MSc thesis, Programming Research Group, Oxford.
10. Grädel, E.; Kolaitis, P. G.; Libkin, L.; Marx, M.; Spencer, J.; Vardi, M. Y.; Venema, Y.; and S.Weinstein. 2007. Finite Model Theory and Its Applications. Texts in Theoretical Computer Science. Springer.
11. Grädel, E. 1999. Why are modal logics so robustly decidable? Bulletin of the European Association for Theoretical Computer Science 68:90-103.
12. Grohe, M. 1998. Fixed-point logics on planar graphs. In Proc. of LICS'98, 6-15.
13. Grohe, M. 1999. Equivalence in finite-variable logics is complete for polynomial time. Combinatorica 19(4):507-532.
14. Grohe, M. 2010. Fixed-point definability and polynomial time on graphs with excluded minors. In Proc. of LICS'10, 179-188.
15. Hanf, W. 1965. Model-theoretic methods in the study of elementary logic. In Addison, J.; Henkin, L.; and Tarski, A., eds., The Theory of Models. North Holland. 132-145.
16. Hazarika, S. M., and Bhowmick, A. 2011. Learning rules of a card game from video. Artificial Intelligence Review 1-11.
17. Immerman, N. 1982. Relational queries computable in polynomial time. In Proc. of STOC'82, 147-152.
18. Immerman, N. 1987. Languages that capture complexity classes. SIAM J. Comput. 16(4):760-778.
19. Kaiser, Ł., and Stafiniak, Ł. 2011. First-order logic with counting for general game playing. In Proc. of AAAI-11, 791-796. AAAI Press.
20. Muggleton, S. 1995. Inverse entailment and Progol. New Generation Comput. 13(3&4):245-286.
21. Needham, C. J.; Santos, P. E.; Magee, D. R.; Devin, V. E.; Hogg, D. C.; and Cohn, A. G. 2005. Protocols from perceptual observations. Artif. Intell. 167(1-2):103-136.
22. Pezzoli, E. 1998. Computational complexity of Ehrenfeucht- Fraïssé games on finite structures. In Proc. of CSL'98, 159-170.
23. Pikhurko, O., and Verbitsky, O. 2010. Logical complexity of graphs: a survey. CoRR abs/1003.4865.
24. Santos, P.; Colton, S.; and Magee, D. R. 2006. Predictive and descriptive approaches to learning game rules from vision data. In Proc. of IBERAMIA-SBIA, 349-359.
25. Toss. http://toss.sf.net.
26. Vardi, M. Y. 1982. The complexity of relational query languages. In Proc. of STOC'82, 137-146.