For specifying and verifying branching-time requirements, a reactive system is traditionally modeled as a labeled tree, where a path in the tree encodes a possible execution of the...
Hex, the classic board game invented by Piet Hein in 1942 and independently by John Nash in 1948, has been a domain of artificial intelligence research since Claude Shannon's ...
Broderick Arneson, Ryan B. Hayward, Philip Henders...
Graph searching games have been extensively studied in the past years. The graph searching problem involves a team of searchers who are attempting to capture a fugitive moving alon...
We examine the problem of self-adaptation in game-playing agents as the game requirements evolve incrementally. The goal of our current work is to develop an interactive environme...
Joshua Jones, Chris Parnin, Avik Sinharoy, Spencer...
Tree pattern matching is a fundamental problem that has a wide range of applications in Web data management, XML processing, and selective data dissemination. In this paper we deve...