We study the complexity of evaluating positive equality-free sentences of first-order (FO) logic over fixed, finite structures B. This may be seen as a natural generalisation of th...
This paper reports the results of a self-paced reading experiment in Japanese in which the materials consisted of four versions of successively more nested syntactic structures. I...
In this paper we prove that for any infinite word w whose set of factors is closed under reversal, the following conditions are equivalent: (I) all complete returns to palindromes...
Michelangelo Bucci, Alessandro De Luca, Amy Glen, ...
This paper studies the complexity of behavior of multi-agent systems. Behavior properties are formulated using classical temporal logic languages and are checked with respect to t...
Michael I. Dekhtyar, Alexander Ja. Dikovsky, Mars ...
Simulation and modeling is becoming one of the standard approaches to understand complex biochemical processes. Therefore, there is a big need for software tools that allow access...
Stefan Hoops, Sven Sahle, Ralph Gauges, Christine ...