We study tree languages that can be defined in 2. These are tree languages definable by a first-order formula whose quantifier prefix is , and simultaneously by a first-order for...
Abstract. Probabilistic timed automata are an extension of timed automata with discrete probability distributions. Simulation and bisimulation relations are widely-studied in the c...
We consider a formal framework for property verification of web applications using Spin model checker. Some of the web related properties concern all states of the model, while ot...
May Haydar, Sergiy Boroday, Alexandre Petrenko, Ho...
Abstract. In this paper, we combine deontic logic with Alternatingtime Temporal Logic (ATL) into a framework that makes it possible to model and reason about obligations and abilit...
Wojciech Jamroga, Wiebe van der Hoek, Michael Wool...
Abstract. Many reinforcement learning domains are highly relational. While traditional temporal-difference methods can be applied to these domains, they are limited in their capaci...
Trevor Walker, Lisa Torrey, Jude W. Shavlik, Richa...