Abstract. We consider a fully SAT-based method of unbounded symbolic model checking based on computing Craig interpolants. In benchmark studies using a set of large industrial circ...
In previous work we have developed a syntactic reduction of repeated reachability to reachability for finite state systems. This may lead to simpler and more uniform proofs for mo...
Abstract. Live role-playing (LRP) games stand as powerful metaphorical models for the various digital and ubiquitous forms of entertainment that gather under the term pervasive gam...
There has been increasing interest in using games for education, but little investigation of how to model student learning within games [cf. 6]. We investigate how existing techniq...
Ryan Shaun Joazeiro de Baker, M. P. Jacob Habgood,...
Classical game theoretic approaches that make strong rationality assumptions have difficulty modeling human behaviour in economic games. We investigate the role of finite levels o...
Debajyoti Ray, Brooks King-Casas, P. Read Montague...