In this paper we study the complexity of the reachability problem Hornets, an algebraic extension of object nets. Here we consider the restricted class of safe, elementary Hornets....
Robustness of timed systems aims at studying whether infinitesimal perturbations in clock values can result in new discrete behaviors. A model is robust if the set of discrete beh...
We employ automata over infinite alphabets to capture the semantics of a finitary fragment of ML with ground-type references. Our approach is founded on game semantics, which all...
In this paper we explore the possibility of introducing the equality symbol in the languages of Fuzzy Description Logics (FDLs) interpreted as a similarity relation. In the talk w...
We provide a methodology to introduce proof search oriented calculi for a large class of many-valued logics, and a sufficient condition for their Co-NP completeness. Our results a...
In NLG systems, temporal uncertainty in raw data can hamper the inference of temporal and causal relationships between events and thus impact the quality of the generated texts. I...
A discrete t-norm is a binary operation on a finite subset of the real unit interval fulfilling the same algebraic conditions as t-norms. We show that any left-continuous t-norm...
We develop a version of the fundamental theorem of asset pricing for discrete-time markets with proportional transaction costs and model uncertainty. A robust notion of no-arbitra...
We derive dual characterizations of two notions of weak time consistency for concave valuations, which are convex risk measures under a positive sign convention. Combined with a s...