Starting from a decomposition result of MTL-chains as ordinal sums, we focus our attention on a particular kind of indecomposable semihoops, namely weakly cancellative semihoops. ...
In the refinement calculus, monotonic predicate transformers are used to model specifications for (imperative) programs. Together with a natural notion of simulation, they form a...
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...
ntation in Abstract Interpretation AGOSTINO CORTESI Universit`a di Venezia GILBERTO FIL´E Universit`a di Padova ROBERTO GIACOBAZZI Universit`a di Pisa CATUSCIA PALAMIDESSI Univers...
Abstract—Geometric Algebra (GA), a generalization of quaternions, is a very powerful form for intuitively expressing and manipulating complex geometric relationships common to en...
Jens Huthmann, Peter Muller, Florian Stock, Dietma...