4 search results - page 1 / 1 » (Mechanical) Reasoning on Infinite Extensive Games |
CORR
2008
Springer
13 years 4 months ago
2008
Springer
In order to better understand reasoning involved in analyzing infinite games in extensive form, we performed the experiments in proof assistant Coq that are reported here.
AAAI
2012
11 years 7 months ago
2012
General Game Playing (GGP) agents must be capable of playing a wide variety of games skillfully. Monte-Carlo Tree Search (MCTS) has proven an effective reasoning mechanism for thi...
LATA
2010
Springer
13 years 8 months ago
2010
Springer
Automated reasoning about systems with infinite domains requires an extension of regular automata to infinite alphabets. Existing formalisms of such automata cope with the infinite...
CORR
2008
Springer
13 years 4 months ago
2008
Springer
The unsplittable flow problem is one of the most extensively studied optimization problems in the field of networking. An instance of it consists of an edge capacitated graph and ...