A method to check the satisfaction of continuous-time constraints by nonlinear stories

Within an interactive storytelling context, stories are essentially nonlinear, i.e., they correspond to multiple alternative sequences of events and each event can usually have multiple different outcomes. In this context, branching-time logics tend to be a coherent option to handle the possible states of an interactive story. In addition, important properties of the stories, such as the emotions they generate, continuously vary over time. In this paper, we describe an implemented method to check whether (parts of) interactive stories satisfy continuous-time constraints specified by means of a temporal modal logic, assuming that the time is continuous and branched. The method was applied to a story context with variants of the Little Red Riding Hood fairy tale.