In this paper, we show that there is a close relation between consistency in a constraint network and set intersection. A proof schema is provided as a generic way to obtain consi...
We give a new presentation of two results concerning synchronized automata. The first one gives a linear bound on the synchronization delay of complete local automata. The second o...
In this paper we present a polynomial-time procedure to find a low rank solution for a system of Linear Matrix Inequalities (LMI). The existence of such a low rank solution was sh...
The quantified relevant logic RQ is given a new semantics in which a formula xA is true when there is some true proposition that implies all x-instantiations of A. Formulae are mo...
The Tyrolean Termination Tool (TTT for short) is a powerful tool for automatically proving termination of rewrite systems. It incorporates several new refinements of the dependen...